{"id":"https://openalex.org/W2888133868","doi":"https://doi.org/10.1142/s012905411842011x","title":"On the Strength of Unambiguous Tree Automata","display_name":"On the Strength of Unambiguous Tree Automata","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2888133868","doi":"https://doi.org/10.1142/s012905411842011x","mag":"2888133868"},"language":"en","primary_location":{"id":"doi:10.1142/s012905411842011x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411842011x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016302450","display_name":"Henryk Michalewski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210137370","display_name":"Institute of Mathematics","ror":"https://ror.org/04hrrh248","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210137370","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Henryk Michalewski","raw_affiliation_strings":["Institute of Mathematics, University of Warsaw, Banacha 2, Warsaw 02-097, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, University of Warsaw, Banacha 2, Warsaw 02-097, Poland","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210137370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073562431","display_name":"Micha\u0142 Skrzypczak","orcid":"https://orcid.org/0000-0002-9647-4993"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Micha\u0142 Skrzypczak","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Banacha 2, Warsaw 02-097, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Banacha 2, Warsaw 02-097, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073562431"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13351369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"05","first_page":"911","last_page":"933"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5965132713317871},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5948240756988525},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5756807327270508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5417041182518005},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5160602927207947},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4176121652126312},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4160754084587097},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4093630611896515},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3825506567955017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29518288373947144},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.2865627408027649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.250502347946167},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1933409571647644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10094094276428223}],"concepts":[{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5965132713317871},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5948240756988525},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5756807327270508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5417041182518005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5160602927207947},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4176121652126312},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4160754084587097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4093630611896515},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3825506567955017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29518288373947144},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.2865627408027649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.250502347946167},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1933409571647644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10094094276428223}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905411842011x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905411842011x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1539382740","https://openalex.org/W1584587517","https://openalex.org/W1984317147","https://openalex.org/W2050073538","https://openalex.org/W2074210660","https://openalex.org/W2126399192","https://openalex.org/W2164417367"],"related_works":["https://openalex.org/W2003664089","https://openalex.org/W1990283467","https://openalex.org/W2408583837","https://openalex.org/W63685668","https://openalex.org/W1482505495","https://openalex.org/W2404099564","https://openalex.org/W2810776027","https://openalex.org/W2091988401","https://openalex.org/W186350370","https://openalex.org/W3135656023"],"abstract_inverted_index":{"This":[0],"work":[1],"is":[2,37,106,120,131,152,171,226],"a":[3,58,121,132,174,195,217],"study":[4],"of":[5,8,46,84,110,154,161,177,185],"the":[6,32,43,47,51,62,70,102,111,143,162,183,189,200,221],"class":[7,144],"non-deterministic":[9,186],"automata":[10,187],"on":[11,24,173],"infinite":[12],"trees":[13],"that":[14,34,150],"are":[15],"unambiguous":[16,38,78],"i.e.":[17],"have":[18],"at":[19],"most":[20],"one":[21,201],"accepting":[22],"run":[23],"every":[25],"tree.":[26],"The":[27,168],"motivating":[28],"question":[29],"asks":[30],"if":[31,116],"fact":[33],"an":[35,77,94],"automaton":[36,80,96,123],"implies":[39,149],"some":[40],"drop":[41,59,219],"in":[42,108,220],"descriptive":[44],"complexity":[45,218],"language":[48],"recognised":[49],"by":[50,207],"automaton.":[52,135],"As":[53],"it":[54,151],"turns":[55],"out,":[56],"such":[57,228],"occurs":[60],"for":[61,69],"parity":[63,72,79,191],"index":[64,85,156,164],"and":[65,160,179],"does":[66],"not":[67],"occur":[68],"weak":[71,133,190,222],"index.":[73],"More":[74],"precisely,":[75],"given":[76],"[Formula:":[81,86,97,117,128,138,145,157,165],"see":[82,87,98,118,125,129,139,146,158,166],"text]":[83,99,119,130,140,159],"text],":[88,147],"we":[89,193],"show":[90],"how":[91],"to":[92,142,199,215],"construct":[93],"alternating":[95,134,155],"which":[100],"accepts":[101],"same":[103],"language,":[104],"but":[105],"simpler":[107],"terms":[109],"acceptance":[112],"condition.":[113],"In":[114,136,182],"particular,":[115],"B\u00fcchi":[122],"([Formula:":[124],"text])":[126],"then":[127],"general,":[137],"belongs":[141],"what":[148],"simultaneously":[153],"dual":[163],"text].":[167],"transformation":[169],"algorithm":[170],"based":[172],"separation":[175,196,210],"procedure":[176,197,211],"Arnold":[178],"Santocanale":[180],"(2005).":[181],"case":[184],"with":[188],"condition,":[192],"provide":[194],"analogous":[198],"used":[202,214],"above.":[203],"However,":[204],"as":[205,224],"illustrated":[206],"examples,":[208],"this":[209],"cannot":[212],"be":[213],"prove":[216],"case,":[223],"there":[225],"no":[227],"drop.":[229]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}