{"id":"https://openalex.org/W1975246937","doi":"https://doi.org/10.1137/0218083","title":"Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation","display_name":"Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W1975246937","doi":"https://doi.org/10.1137/0218083","mag":"1975246937"},"language":"en","primary_location":{"id":"doi:10.1137/0218083","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218083","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/A5065615032","display_name":"Bala Ravikumar","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bala Ravikumar","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110211208","display_name":"\u00d3scar H. Ibarra","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oscar H. Ibarra","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065615032"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":2.3818,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.87943364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"6","first_page":"1263","last_page":"1282"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9959999918937683,"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/T11130","display_name":"Coding theory and cryptography","score":0.9950000047683716,"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/succinctness","display_name":"Succinctness","score":0.7722944021224976},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6843958497047424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6828960180282593},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6495493054389954},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.6487517356872559},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.574431836605072},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5507843494415283},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5059563517570496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4945339858531952},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4823260009288788},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.451150119304657},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4479248523712158},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4234985411167145},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.27066636085510254},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.16831064224243164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14407476782798767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08333361148834229},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07989540696144104}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.7722944021224976},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6843958497047424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6828960180282593},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6495493054389954},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.6487517356872559},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.574431836605072},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5507843494415283},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5059563517570496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4945339858531952},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4823260009288788},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.451150119304657},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4479248523712158},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4234985411167145},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.27066636085510254},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.16831064224243164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14407476782798767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08333361148834229},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07989540696144104},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0218083","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218083","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W4457062","https://openalex.org/W42196011","https://openalex.org/W110214102","https://openalex.org/W421997344","https://openalex.org/W1480319329","https://openalex.org/W1534970688","https://openalex.org/W1598450631","https://openalex.org/W1672478560","https://openalex.org/W1971747251","https://openalex.org/W1975698236","https://openalex.org/W1978033038","https://openalex.org/W2000095412","https://openalex.org/W2003000704","https://openalex.org/W2025256949","https://openalex.org/W2034243894","https://openalex.org/W2042720934","https://openalex.org/W2050431915","https://openalex.org/W2054801208","https://openalex.org/W2057182494","https://openalex.org/W2059200976","https://openalex.org/W2066064214","https://openalex.org/W2068490784","https://openalex.org/W2080070043","https://openalex.org/W2088539304","https://openalex.org/W2090921231","https://openalex.org/W2149288970","https://openalex.org/W2269685284","https://openalex.org/W2798619248","https://openalex.org/W4212875940","https://openalex.org/W4292806204"],"related_works":["https://openalex.org/W2170813354","https://openalex.org/W1945859206","https://openalex.org/W2407531803","https://openalex.org/W2173721792","https://openalex.org/W1551895525","https://openalex.org/W2522784448","https://openalex.org/W2067443406","https://openalex.org/W61785131","https://openalex.org/W2012104236","https://openalex.org/W2096694877"],"abstract_inverted_index":{"This":[0,351],"paper":[1,337],"considers":[2],"the":[3,7,21,26,29,32,35,143,157,166,169,179,183,189,206,211,228,251,253,260,272,324,332],"problem":[4,355,362],"of":[5,9,23,25,40,45,94,126,134,145,160,162,182,204,208,227,231,250,282,291,327,331,335,356,385],"how":[6,205],"size":[8,36,212],"a":[10,16,74,139,151,201,240,279],"nondeterministic":[11],"finite":[12],"automaton":[13],"(nfa)":[14],"representing":[15],"regular":[17],"language":[18,170],"depends":[19],"on":[20],"type":[22,95,103,127,135,163,207],"ambiguity":[24,33,209],"nfa.":[27],"Primarily,":[28],"relationship":[30],"between":[31,382],"and":[34,59,147,196,216,277,297,314,318,349,358,376,378],"in":[37,142,270,284],"five":[38,184,229],"types":[39,230],"nfa\u2019s":[41,386],"with":[42,97,137,165],"increasing":[43],"degrees":[44],"nondeterminism":[46,232],"is":[47,66,77,172,191,223,233,287,299,304,344,363],"studied:":[48],"DFA":[49],"(deterministic),":[50],"${\\operatorname{UNA}}$":[51],"(unambiguous),":[52],"${\\operatorname{FNA}}$":[53],"(finitely":[54],"ambiguous),":[55,58],"${\\operatorname{PNA}}$":[56],"(polynomially":[57],"${\\operatorname{ENA}}$":[60],"(exponentially":[61],"ambiguous)":[62],"nfa\u2019s.":[63],"The":[64,174,289,360],"goal":[65],"to":[67,79,132,306],"show":[68],"\u201cseparation\u201d":[69],"among":[70],"these":[71],"classes,":[72],"where":[73],"class":[75,152,159,302],"A":[76,104,128,301,313],"said":[78,305],"be":[80,130,268,307,321],"\u201cseparated\u201d":[81],"from":[82,235,259],"B":[83,96,136,315],"(written":[84,120],"($A,B$))":[85],"if":[86,124,316],"for":[87,111,214,248,340],"infinitely":[88],"many":[89],"n,":[90],"there":[91],"are":[92,117,264,387],"machines":[93,125,133,161],"n":[98],"states":[99,110],"whose":[100],"minimal":[101],"equivalent":[102],"machine":[105],"has":[106],"more":[107],"than":[108],"$p(n)$":[109],"any":[112],"polynomial":[113,140],"p.":[114],"Two":[115],"classes":[116,185,312,384],"\u201cpolynomially":[118],"equivalent\u201d":[119],"$A":[121],"=":[122,194,198],"B$)":[123],"can":[129,320],"converted":[131],"only":[138],"increase":[141],"number":[144],"states,":[146],"vice":[148],"versa.":[149],"For":[150,219],"X,":[153],"let":[154],"$X(b)$)":[155],"denote":[156],"restricted":[158],"X":[164],"restriction":[167],"that":[168,225,266],"accepted":[171],"bounded.":[173],"first":[175],"main":[176,333],"result":[177],"compares":[178],"bounded":[180,217],"restrictions":[181],"mentioned":[186],"above.":[187],"Specifically,":[188],"following":[190],"shown:":[192],"$({\\operatorname{DFA}}(b),{\\operatorname{UNA}}(b)),({\\operatorname{UNA}}(b),{\\operatorname{FNA}}(b)),{\\operatorname{FNA}}(b)":[193],"{\\operatorname{PNA}}(b)$":[195],"${\\operatorname{PNA}}(b)":[197],"{\\operatorname{ENA}}(b)$,":[199],"providing":[200],"complete":[202],"picture":[203],"affects":[210],"complexity":[213],"unary":[215,261],"languages.":[218,329],"unbounded":[220],"languages":[221],"it":[222],"conjectured":[224,275],"each":[226],"separate":[234],"its":[236],"higher":[237],"types.":[238],"But":[239],"proof":[241],"does":[242],"not":[243],"exist":[244],"at":[245],"this":[246,336],"time":[247],"two":[249,255,311],"separations,":[252,276],"other":[254],"carrying":[256],"over":[257,310,347],"directly":[258],"case.":[262],"Candidates":[263],"offered":[265],"may":[267],"useful":[269],"proving":[271],"(other":[273],"two)":[274],"also":[278,364],"weaker":[280],"form":[281],"separation":[283],"one":[285],"case":[286],"shown.":[288,388],"notion":[290],"\u201cconcurrent":[292],"conciseness\u201d":[293],"introduced":[294],"by":[295,374],"Kintala":[296],"Wotschke":[298],"studied.":[300],"C":[303],"concurrently":[308,345],"concise":[309,346],"$(A,B)$":[317],"$(B,C)$":[319],"proved":[322],"using":[323],"same":[325],"collection":[326],"witness":[328],"One":[330],"results":[334],"shows":[338],"that,":[339],"unrestricted":[341],"inputs,":[342],"PNA":[343],"${\\operatorname{DFA}}$":[348],"${\\operatorname{UNA}}$.":[350],"answers":[352],"an":[353,371],"open":[354],"Stearns":[357],"Hunt.":[359],"succinctness":[361],"studied":[365],"through":[366],"(regularity":[367],"preserving)":[368],"closure":[369],"properties,":[370],"approach":[372],"initiated":[373],"Sakoda":[375],"Sipser,":[377],"some":[379],"interesting":[380],"contrasts":[381],"various":[383]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"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":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}