{"id":"https://openalex.org/W3082349081","doi":"https://doi.org/10.46298/lmcs-17(3:18)2021","title":"Ambiguity Hierarchy of Regular Infinite Tree Languages","display_name":"Ambiguity Hierarchy of Regular Infinite Tree Languages","publication_year":2021,"publication_date":"2021-08-13","ids":{"openalex":"https://openalex.org/W3082349081","doi":"https://doi.org/10.4230/lipics.mfcs.2020.80","mag":"3082349081"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-17(3:18)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(3:18)2021","pdf_url":"https://lmcs.episciences.org/8356/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/8356/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007681536","display_name":"Alexander Rabinovich","orcid":"https://orcid.org/0000-0002-1460-2358"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Alexander Rabinovich","raw_affiliation_strings":["Tel Aviv University, Israel","Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019233565","display_name":"Doron Tiferet","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Doron Tiferet","raw_affiliation_strings":["Tel Aviv University, Israel","Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007681536"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.1508,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46800993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"Volume 17, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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":0.9994999766349792,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9832000136375427,"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/T12029","display_name":"DNA and Biological Computing","score":0.978600025177002,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.7431609034538269},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.641277551651001},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5869106650352478},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5750458240509033},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5351340174674988},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.533366858959198},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5180590152740479},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.5010185241699219},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49528947472572327},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4480731785297394},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.44207167625427246},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.41490280628204346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39352840185165405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3058924973011017},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.23370960354804993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20623713731765747},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1937820315361023},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.18607428669929504}],"concepts":[{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7431609034538269},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.641277551651001},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5869106650352478},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5750458240509033},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5351340174674988},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.533366858959198},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5180590152740479},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.5010185241699219},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49528947472572327},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4480731785297394},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.44207167625427246},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.41490280628204346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39352840185165405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3058924973011017},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.23370960354804993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20623713731765747},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1937820315361023},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.18607428669929504},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.46298/lmcs-17(3:18)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(3:18)2021","pdf_url":"https://lmcs.episciences.org/8356/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2009.02985","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2009.02985","pdf_url":"https://arxiv.org/pdf/2009.02985","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:db4c9c0a7be54ddbb3be680a222b3726","is_oa":true,"landing_page_url":"https://doaj.org/article/db4c9c0a7be54ddbb3be680a222b3726","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 17, Issue 3 (2021)","raw_type":"article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:12749","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.80","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2009.02985","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2009.02985","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.mfcs.2020.80","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2020.80","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.46298/lmcs-17(3:18)2021","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-17(3:18)2021","pdf_url":"https://lmcs.episciences.org/8356/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320312914","display_name":"Blavatnik Family Foundation","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3082349081.pdf","grobid_xml":"https://content.openalex.org/works/W3082349081.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1556439147","https://openalex.org/W1888128996","https://openalex.org/W2030037063","https://openalex.org/W2059200976","https://openalex.org/W2170933628","https://openalex.org/W2242649818","https://openalex.org/W2484436671","https://openalex.org/W2611884230","https://openalex.org/W3082349081"],"related_works":["https://openalex.org/W3195076911","https://openalex.org/W2951329069","https://openalex.org/W2242649818","https://openalex.org/W2791555385","https://openalex.org/W2198382712","https://openalex.org/W1520554460","https://openalex.org/W1998361452","https://openalex.org/W2160568435","https://openalex.org/W3093340218","https://openalex.org/W2265316437","https://openalex.org/W2183347322","https://openalex.org/W3082239530","https://openalex.org/W2907462136","https://openalex.org/W1974309915","https://openalex.org/W2403587904","https://openalex.org/W2964270270","https://openalex.org/W1546126118","https://openalex.org/W2952426973","https://openalex.org/W1551001016","https://openalex.org/W2505646194"],"abstract_inverted_index":{"An":[0,15,34,48],"automaton":[1,16,35,49,140],"is":[2,17,36,41,50,77,85,94,111,123,134,166],"unambiguous":[3,127,138],"if":[4,23,39,55,92],"for":[5,24,43,56],"every":[6,25,57,108,120,131,174],"input":[7,26,58],"it":[8,27,40,59,93],"has":[9,28,60],"at":[10,29,61],"most":[11,30,62],"one":[12],"accepting":[13,32,67],"computation.":[14],"k-ambiguous":[18,42,86,98,180],"(for":[19],"k":[20,31,175,185],">":[21,176],"0)":[22],"computations.":[33,68],"boundedly":[37,201],"ambiguous":[38,54,157,196],"some":[44],"$k":[45],"\\in":[46],"\\mathbb{N}$.":[47],"finitely":[51,63,192],"(respectively,":[52,64,87,99],"countably)":[53,65,204],"many":[66],"The":[69],"degree":[70],"of":[71,73,169,171],"ambiguity":[72],"a":[74,80,97,114,143,167],"regular":[75,109,121,132],"language":[76,84,110,122,133],"defined":[78],"in":[79],"natural":[81],"way.":[82],"A":[83],"boundedly,":[88,100],"finitely,":[89,101,203],"countably":[90,102],"ambiguous)":[91,103],"accepted":[95,112,124,135],"by":[96,113,125,136,142],"automaton.":[104,116,128,146],"Over":[105,117,129,147],"finite":[106,118],"words":[107],"deterministic":[115,144],"trees":[119,149,164],"an":[126,137],"$\\omega$-words":[130],"B\\\"uchi":[139],"and":[141,189],"parity":[145],"infinite":[148,163],"Carayol":[150],"et":[151],"al.":[152],"showed":[153],"that":[154,161,182,198],"there":[155,165,178,190],"are":[156,179,183,191,199],"languages.":[158],"We":[159],"show":[160],"over":[162],"hierarchy":[168],"degrees":[170],"ambiguity:":[172],"For":[173],"1":[177,187],"languages":[181,197],"not":[184,200],"-":[186],"ambiguous;":[188],"(respectively":[193,202],"countably,":[194],"uncountably)":[195],"ambiguous.":[205]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2020-09-08T00:00:00"}