{"id":"https://openalex.org/W2611884230","doi":"https://doi.org/10.14232/actacyb.23.1.2017.9","title":"Ambiguity, Nondeterminism and State Complexity of Finite Automata","display_name":"Ambiguity, Nondeterminism and State Complexity of Finite Automata","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2611884230","doi":"https://doi.org/10.14232/actacyb.23.1.2017.9","mag":"2611884230"},"language":"en","primary_location":{"id":"doi:10.14232/actacyb.23.1.2017.9","is_oa":true,"landing_page_url":"https://doi.org/10.14232/actacyb.23.1.2017.9","pdf_url":null,"source":{"id":"https://openalex.org/S5962179","display_name":"Acta Cybernetica","issn_l":"0324-721X","issn":["0324-721X","2676-993X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315420","host_organization_name":"University of Szeged","host_organization_lineage":["https://openalex.org/P4310315420"],"host_organization_lineage_names":["University of Szeged"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Cybernetica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.14232/actacyb.23.1.2017.9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077698683","display_name":"Yo-Sub Han","orcid":"https://orcid.org/0000-0002-7211-6657"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yo-Sub Han","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113495698","display_name":"Arto Salomaa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arto Salomaa","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5009151151","display_name":"Kai Salomaa","orcid":"https://orcid.org/0000-0003-4582-7477"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kai Salomaa","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077698683"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3627,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.82384546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"23","issue":"1","first_page":"141","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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.9966999888420105,"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/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.788438081741333},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.7099606990814209},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6272988319396973},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6251751184463501},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5952968001365662},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5551877021789551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5363937616348267},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5363852381706238},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5357956290245056},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4192715287208557},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40522414445877075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3899834156036377},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3578230142593384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35405370593070984},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.25595563650131226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.134547621011734},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08572360873222351}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.788438081741333},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.7099606990814209},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6272988319396973},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6251751184463501},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5952968001365662},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5551877021789551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5363937616348267},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5363852381706238},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5357956290245056},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4192715287208557},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40522414445877075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3899834156036377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3578230142593384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35405370593070984},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.25595563650131226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.134547621011734},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08572360873222351},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14232/actacyb.23.1.2017.9","is_oa":true,"landing_page_url":"https://doi.org/10.14232/actacyb.23.1.2017.9","pdf_url":null,"source":{"id":"https://openalex.org/S5962179","display_name":"Acta Cybernetica","issn_l":"0324-721X","issn":["0324-721X","2676-993X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315420","host_organization_name":"University of Szeged","host_organization_lineage":["https://openalex.org/P4310315420"],"host_organization_lineage_names":["University of Szeged"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Cybernetica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.14232/actacyb.23.1.2017.9","is_oa":true,"landing_page_url":"https://doi.org/10.14232/actacyb.23.1.2017.9","pdf_url":null,"source":{"id":"https://openalex.org/S5962179","display_name":"Acta Cybernetica","issn_l":"0324-721X","issn":["0324-721X","2676-993X"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315420","host_organization_name":"University of Szeged","host_organization_lineage":["https://openalex.org/P4310315420"],"host_organization_lineage_names":["University of Szeged"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Cybernetica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1539025858","https://openalex.org/W1601640063","https://openalex.org/W2015787121","https://openalex.org/W2056112658","https://openalex.org/W2057841333","https://openalex.org/W2131886132","https://openalex.org/W2154178113","https://openalex.org/W2156139008","https://openalex.org/W2157017998","https://openalex.org/W2165700161","https://openalex.org/W2167473451"],"related_works":["https://openalex.org/W2111868903","https://openalex.org/W1428391281","https://openalex.org/W2100711766","https://openalex.org/W3087272834","https://openalex.org/W3012311918","https://openalex.org/W2066562587","https://openalex.org/W4281261571","https://openalex.org/W1945859206","https://openalex.org/W2116593309","https://openalex.org/W2146605784"],"abstract_inverted_index":{"The":[0],"degree":[1,58],"of":[2,7,10,23,33,42,44,59],"ambiguity":[3,60,81],"counts":[4],"the":[5,21,31,40,45,57],"number":[6,41],"accepting":[8],"computations":[9],"a":[11,17,36,49],"nondeterministic":[12],"finite":[13,67],"automaton":[14],"(NFA)":[15],"on":[16,48,56,62,73],"given":[18,50],"input.":[19,51],"Alternatively,":[20],"nondeterminism":[22,64],"an":[24],"NFA":[25],"can":[26],"be":[27],"measured":[28],"by":[29],"counting":[30],"amount":[32],"guessing":[34],"in":[35],"single":[37],"computation":[38,46],"or":[39,82],"leaves":[43],"tree":[47],"This":[52],"paper":[53],"surveys":[54],"work":[55],"and":[61],"various":[63],"measures":[65],"for":[66],"automata.":[68],"In":[69],"particular,":[70],"we":[71],"focus":[72],"state":[74],"complexity":[75],"comparisons":[76],"between":[77],"NFAs":[78],"with":[79],"quantified":[80],"nondeterminism.":[83]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}