{"id":"https://openalex.org/W1513363691","doi":"https://doi.org/10.25596/jalc-2004-347","title":"B\u00fcchi Automata and Their Degrees of Nondeterminism and Ambiguity","display_name":"B\u00fcchi Automata and Their Degrees of Nondeterminism and Ambiguity","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1513363691","doi":"https://doi.org/10.25596/jalc-2004-347","mag":"1513363691"},"language":"en","primary_location":{"id":"doi:10.25596/jalc-2004-347","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-347","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.25596/jalc-2004-347","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076298660","display_name":"Frank Nie\u00dfner","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Niessner, Frank","raw_affiliation_strings":["Computer Science Department, University of Frankfurt, Frankfurt, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Frankfurt, Frankfurt, Germany","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076298660"],"corresponding_institution_ids":["https://openalex.org/I114090438"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0597786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"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":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/T10126","display_name":"Logic, programming, and type systems","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.8230032920837402},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.811164140701294},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7713274955749512},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6239143013954163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6059982776641846},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5360339879989624},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5332982540130615},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.48549845814704895},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.43764957785606384},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4291608929634094},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.41089293360710144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4097869396209717},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4029375910758972},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36169564723968506},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3486475348472595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2971671223640442},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.24158251285552979},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15777993202209473}],"concepts":[{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.8230032920837402},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.811164140701294},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7713274955749512},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6239143013954163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6059982776641846},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5360339879989624},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5332982540130615},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.48549845814704895},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.43764957785606384},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4291608929634094},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.41089293360710144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4097869396209717},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4029375910758972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36169564723968506},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3486475348472595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2971671223640442},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.24158251285552979},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15777993202209473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.25596/jalc-2004-347","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-347","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.25596/jalc-2004-347","is_oa":true,"landing_page_url":"https://doi.org/10.25596/jalc-2004-347","pdf_url":null,"source":{"id":"https://openalex.org/S7407052944","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1482244486","https://openalex.org/W1990609140","https://openalex.org/W2002089154","https://openalex.org/W2031592188","https://openalex.org/W2033071128","https://openalex.org/W2066768040","https://openalex.org/W2091227187","https://openalex.org/W2138856440","https://openalex.org/W2154178113"],"related_works":["https://openalex.org/W2399215002","https://openalex.org/W2955374611","https://openalex.org/W2402012570","https://openalex.org/W1604738535","https://openalex.org/W1523939218","https://openalex.org/W2621024811","https://openalex.org/W1983601687","https://openalex.org/W2009929770","https://openalex.org/W2173721792","https://openalex.org/W2611896911","https://openalex.org/W3146824122","https://openalex.org/W3006504376","https://openalex.org/W2400175085","https://openalex.org/W1877652378","https://openalex.org/W2078669675","https://openalex.org/W1804899877","https://openalex.org/W2074949881","https://openalex.org/W3107587550","https://openalex.org/W1561689075","https://openalex.org/W128496866"],"abstract_inverted_index":{"Nondeterminism":[0],"and":[1,19,51,62,95,122],"ambiguity":[2,52,96],"in":[3],"abstract":[4],"machines":[5],"can":[6],"be":[7],"considered":[8],"as":[9],"consumable":[10],"resources.":[11],"This":[12],"was":[13],"first":[14],"done":[15],"by":[16],"Goldstine,":[17],"Kintala":[18],"Wotschke":[20],"for":[21,65,109],"finite":[22,29],"automata.":[23],"We":[24,40],"extend":[25],"their":[26],"method":[27],"to":[28,46,56,100],"automata":[30,43],"which":[31],"accept":[32,57,101],"words":[33],"of":[34,49,67,84,93,113],"infinite":[35],"length,":[36],"so-called":[37],"regular":[38,60,78,104],"$\\omega$-automata.":[39],"classify":[41],"the":[42,47,68,76,85,91],"with":[44],"respect":[45],"amount":[48,92],"nondeterminism":[50,94,114,121],"that":[53,75,97,115],"is":[54,71,98,117],"needed":[55],"a":[58,72,81,102],"corresponding":[59],"$\\omega$-language":[61],"present":[63],"examples":[64],"each":[66],"classes.":[69],"It":[70],"well-known":[73],"fact":[74],"deterministic":[77],"$\\omega$-languages":[79],"are":[80],"proper":[82],"subset":[83],"nondeterministic":[86,103],"ones.":[87],"Hence":[88],"we":[89,107],"specify":[90],"necessary":[99],"$\\omega$-language.":[105],"Finally,":[106],"show":[108],"all":[110],"possible":[111],"amounts":[112],"there":[116],"no":[118],"interrelation":[119],"between":[120],"ambiguity.":[123]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2016-06-24T00:00:00"}