{"id":"https://openalex.org/W4290802789","doi":"https://doi.org/10.48550/arxiv.2208.04931","title":"Co-lexicographically Ordering Automata and Regular Languages -- Part I","display_name":"Co-lexicographically Ordering Automata and Regular Languages -- Part I","publication_year":2022,"publication_date":"2022-08-09","ids":{"openalex":"https://openalex.org/W4290802789","doi":"https://doi.org/10.48550/arxiv.2208.04931"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2208.04931","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.04931","pdf_url":"https://arxiv.org/pdf/2208.04931","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2208.04931","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024275216","display_name":"Nicola Cotumaccio","orcid":"https://orcid.org/0000-0002-1402-5298"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cotumaccio, Nicola","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038012736","display_name":"Giovanna D\u2019Agostino","orcid":"https://orcid.org/0000-0002-8920-483X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D'Agostino, Giovanna","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042115100","display_name":"Alberto Policriti","orcid":"https://orcid.org/0000-0001-8502-5896"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Policriti, Alberto","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007324430","display_name":"Nicola Prezza","orcid":"https://orcid.org/0000-0003-3553-4953"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prezza, Nicola","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024275216"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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":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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9904999732971191,"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/mathematics","display_name":"Mathematics","score":0.7157928943634033},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6814887523651123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6482678651809692},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6340656876564026},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5449926853179932},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5263527631759644},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4991879463195801},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.44482311606407166},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4298972487449646},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4295901656150818},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.41954901814460754},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3944658637046814},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.31215476989746094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19454559683799744},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1352117955684662}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7157928943634033},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6814887523651123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6482678651809692},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6340656876564026},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5449926853179932},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5263527631759644},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4991879463195801},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.44482311606407166},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4298972487449646},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4295901656150818},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.41954901814460754},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3944658637046814},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.31215476989746094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19454559683799744},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1352117955684662},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2208.04931","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.04931","pdf_url":"https://arxiv.org/pdf/2208.04931","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2208.04931","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2208.04931","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2208.04931","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.04931","pdf_url":"https://arxiv.org/pdf/2208.04931","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4290802789.pdf","grobid_xml":"https://content.openalex.org/works/W4290802789.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2090734721","https://openalex.org/W2603910788","https://openalex.org/W2394954760","https://openalex.org/W2105843429","https://openalex.org/W2037872771","https://openalex.org/W185868636","https://openalex.org/W2772918710","https://openalex.org/W2083002627","https://openalex.org/W2281054049","https://openalex.org/W2167032348"],"abstract_inverted_index":{"In":[0,215],"the":[1,34,49,63,98,156,182,197,204,208,223],"present":[2],"work,":[3],"we":[4,195,218],"lay":[5],"out":[6],"a":[7,93,114,171,176,213],"new":[8,58,135],"theory":[9],"showing":[10],"that":[11,56,140,170],"all":[12],"automata":[13,138],"can":[14,27,102,191],"always":[15],"be":[16,28,103,192],"co-lexicographically":[17,227],"partially":[18],"ordered,":[19],"and":[20,30,151,206],"an":[21,80,220],"intrinsic":[22],"measure":[23,59],"of":[24,38,40,65,74,133,137,187,210,212,222],"their":[25,41],"complexity":[26,64],"defined":[29],"effectively":[31],"determined,":[32],"namely,":[33],"minimum":[35],"width":[36,76,205],"$p$":[37,89],"one":[39],"admissible":[42],"co-lex":[43,51,75],"partial":[44],"orders":[45],"-":[46,180,190],"dubbed":[47,181],"here":[48],"automaton's":[50],"width.":[52],"We":[53,168],"first":[54],"show":[55],"this":[57,134,216],"captures":[60],"at":[61],"once":[62],"several":[66],"seemingly-unrelated":[67],"hard":[68],"problems":[69,142],"on":[70],"automata.":[71],"Any":[72],"NFA":[73,145],"$p$:":[77],"(i)":[78],"has":[79],"equivalent":[81],"powerset":[82],"DFA":[83,174],"whose":[84],"size":[85],"is":[86],"exponential":[87],"in":[88,97,123,149],"rather":[90],"than":[91],"(as":[92],"classic":[94],"analysis":[95],"shows)":[96],"NFA's":[99],"size;":[100],"(ii)":[101],"encoded":[104],"using":[105],"just":[106],"$\u0398(\\log":[107],"p)$":[108],"bits":[109],"per":[110,128],"transition;":[111],"(iii)":[112],"admits":[113],"linear-space":[115],"data":[116],"structure":[117],"solving":[118],"regular":[119,157,229],"expression":[120,158],"matching":[121,159],"queries":[122],"time":[124],"proportional":[125],"to":[126],"$p^2$":[127],"matched":[129],"character.":[130],"Some":[131],"consequences":[132],"parametrization":[136],"are":[139,147],"PSPACE-hard":[141],"such":[143],"as":[144],"equivalence":[146],"FPT":[148],"$p$,":[150],"quadratic":[152],"lower":[153],"bounds":[154],"for":[155,164,226],"problem":[160],"do":[161],"not":[162],"hold":[163],"sufficiently":[165],"small":[166],"$p$.":[167],"prove":[169],"canonical":[172],"minimum-width":[173],"accepting":[175],"language":[177],"$\\mathcal":[178,185,188],"L$":[179,189],"Hasse":[183],"automaton":[184],"H$":[186],"exhibited.":[193],"Finally,":[194],"explore":[196],"relationship":[198],"between":[199],"two":[200],"conflicting":[201],"objectives:":[202],"minimizing":[203,207],"number":[209],"states":[211],"DFA.":[214],"context,":[217],"provide":[219],"analogous":[221],"Myhill-Nerode":[224],"Theorem":[225],"ordered":[228],"languages.":[230]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}