{"id":"https://openalex.org/W2079577017","doi":"https://doi.org/10.1137/s0097539793252092","title":"Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata","display_name":"Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata","publication_year":1998,"publication_date":"1998-08-01","ids":{"openalex":"https://openalex.org/W2079577017","doi":"https://doi.org/10.1137/s0097539793252092","mag":"2079577017"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793252092","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793252092","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5102046996","display_name":"Hing Leung","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hing Leung","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102046996"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5084,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.67608941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"27","issue":"4","first_page":"1073","last_page":"1082"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9975000023841858,"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/T12029","display_name":"DNA and Biological Computing","score":0.9961000084877014,"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/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.8551805019378662},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7757713794708252},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.767475962638855},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.7670948505401611},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.7419235110282898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.663467526435852},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6344238519668579},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.609532356262207},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5718410611152649},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.5712910890579224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.558233380317688},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.4911188781261444},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42454084753990173},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.41246384382247925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22921258211135864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18101271986961365},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1689102053642273}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.8551805019378662},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7757713794708252},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.767475962638855},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.7670948505401611},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.7419235110282898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.663467526435852},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6344238519668579},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.609532356262207},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5718410611152649},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.5712910890579224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.558233380317688},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.4911188781261444},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42454084753990173},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.41246384382247925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22921258211135864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18101271986961365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1689102053642273}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539793252092","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793252092","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.667","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nmsu.edu/~hleung/siamPaper.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W110214102","https://openalex.org/W1598450631","https://openalex.org/W1975246937","https://openalex.org/W2002089154","https://openalex.org/W2059200976","https://openalex.org/W2090921231","https://openalex.org/W2149288970","https://openalex.org/W2798301908","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W2030569822","https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W2368684504","https://openalex.org/W2079577017","https://openalex.org/W2050777932","https://openalex.org/W2083848761","https://openalex.org/W309405200","https://openalex.org/W2506511039","https://openalex.org/W2586499659"],"abstract_inverted_index":{"We":[0,31],"resolve":[1],"an":[2],"open":[3],"problem":[4],"raised":[5],"by":[6],"Ravikumar":[7],"and":[8,58,72],"Ibarra":[9],"[SIAM":[10],"J.":[11],"Comput.,":[12],"18":[13],"(1989),":[14],"pp.":[15],"1263--1282]":[16],"on":[17],"the":[18,24,63],"succinctness":[19],"of":[20,26,28,38],"representations":[21],"relating":[22],"to":[23],"types":[25],"ambiguity":[27],"finite":[29,40,67,78],"automata.":[30],"show":[32],"that":[33],"there":[34],"exists":[35],"a":[36,44],"family":[37],"nondeterministic":[39],"automata":[41],"{An}":[42],"over":[43],"two-letter":[45],"alphabet":[46],"such":[47],"that,":[48],"for":[49],"any":[50,73],"positive":[51],"integer":[52],"n,":[53],"An":[54],"is":[55],"exponentially":[56],"ambiguous":[57,77],"has":[59,69,80],"n":[60],"states,":[61,71],"whereas":[62],"smallest":[64,74],"equivalent":[65,75],"deterministic":[66],"automaton":[68,79],"2n":[70,81],"polynomially":[76],"-1":[82],"states.":[83]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}