{"id":"https://openalex.org/W3209919026","doi":"https://doi.org/10.1109/dcc52660.2022.00013","title":"Linear-time Minimization of Wheeler DFAs","display_name":"Linear-time Minimization of Wheeler DFAs","publication_year":2022,"publication_date":"2022-03-01","ids":{"openalex":"https://openalex.org/W3209919026","doi":"https://doi.org/10.1109/dcc52660.2022.00013","mag":"3209919026"},"language":"en","primary_location":{"id":"doi:10.1109/dcc52660.2022.00013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc52660.2022.00013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Data Compression Conference (DCC)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10138/349645","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067903348","display_name":"Jarno Alanko","orcid":"https://orcid.org/0000-0002-8003-9225"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]},{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["CA","FI"],"is_corresponding":false,"raw_author_name":"Jarno Alanko","raw_affiliation_strings":["University of Helsinki,Dept. of Computer Science,Finland","Faculty of Computer Science, Dalhousie University, Halifax, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Helsinki,Dept. of Computer Science,Finland","institution_ids":["https://openalex.org/I133731052"]},{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, Canada","institution_ids":["https://openalex.org/I129902397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024275216","display_name":"Nicola Cotumaccio","orcid":"https://orcid.org/0000-0002-1402-5298"},"institutions":[{"id":"https://openalex.org/I4210150763","display_name":"Gran Sasso Science Institute","ror":"https://ror.org/043qcb444","country_code":"IT","type":"education","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210150763"]},{"id":"https://openalex.org/I4210157067","display_name":"Gatorade Sports Science Institute","ror":"https://ror.org/0559h9k50","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210157067"]}],"countries":["IT","US"],"is_corresponding":false,"raw_author_name":"Nicola Cotumaccio","raw_affiliation_strings":["GSSI,L&#x0027;Aquila,Italy","GSSI, L&#x0027"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GSSI,L&#x0027;Aquila,Italy","institution_ids":["https://openalex.org/I4210150763"]},{"raw_affiliation_string":"GSSI, L&#x0027","institution_ids":["https://openalex.org/I4210157067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007324430","display_name":"Nicola Prezza","orcid":"https://orcid.org/0000-0003-3553-4953"},"institutions":[{"id":"https://openalex.org/I149461666","display_name":"Ca' Foscari University of Venice","ror":"https://ror.org/04yzxz566","country_code":"IT","type":"education","lineage":["https://openalex.org/I149461666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Prezza","raw_affiliation_strings":["DAIS, Ca&#x2019; Foscari University,Venice,Italy","DAIS, Ca&#x2019"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DAIS, Ca&#x2019; Foscari University,Venice,Italy","institution_ids":["https://openalex.org/I149461666"]},{"raw_affiliation_string":"DAIS, Ca&#x2019","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4162,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66287099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"53","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.7262542247772217},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6196702122688293},{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.5958754420280457},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5714410543441772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5607598423957825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.515526294708252},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5057141780853271},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4998612403869629},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.47994354367256165},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4769291281700134},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.45533910393714905},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4357852339744568},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43259960412979126},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4296565055847168},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.42688193917274475},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.4243309199810028},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3572632968425751},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3484494090080261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34640181064605713},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26401427388191223},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.16075384616851807}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.7262542247772217},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6196702122688293},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.5958754420280457},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5714410543441772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5607598423957825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.515526294708252},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5057141780853271},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4998612403869629},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.47994354367256165},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4769291281700134},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.45533910393714905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4357852339744568},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43259960412979126},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4296565055847168},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.42688193917274475},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.4243309199810028},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3572632968425751},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3484494090080261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34640181064605713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26401427388191223},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.16075384616851807},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/dcc52660.2022.00013","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc52660.2022.00013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Data Compression Conference (DCC)","raw_type":"proceedings-article"},{"id":"pmh:oai:helda.helsinki.fi:10138/349645","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/349645","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},{"id":"pmh:oai:iris.unive.it:10278/5004034","is_oa":false,"landing_page_url":"http://hdl.handle.net/10278/5004034","pdf_url":null,"source":{"id":"https://openalex.org/S4306402336","display_name":"ARCA (Universit\u00e0 Ca' Foscari Venezia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149461666","host_organization_name":"Ca' Foscari University of Venice","host_organization_lineage":["https://openalex.org/I149461666"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:helda.helsinki.fi:10138/349645","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/349645","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W6247929","https://openalex.org/W1987760161","https://openalex.org/W2011210839","https://openalex.org/W2018866650","https://openalex.org/W2070830131","https://openalex.org/W2088432971","https://openalex.org/W2122493035","https://openalex.org/W2344013120","https://openalex.org/W2725379159","https://openalex.org/W2888300707","https://openalex.org/W2952379095","https://openalex.org/W3002181530","https://openalex.org/W3014357205","https://openalex.org/W3038120653","https://openalex.org/W3100935868","https://openalex.org/W3177877512","https://openalex.org/W4205775169","https://openalex.org/W4244661353","https://openalex.org/W6772995932","https://openalex.org/W6775798498"],"related_works":["https://openalex.org/W3143588635","https://openalex.org/W2030569822","https://openalex.org/W2136740376","https://openalex.org/W2088578754","https://openalex.org/W1560450186","https://openalex.org/W2000290048","https://openalex.org/W72746997","https://openalex.org/W2160879187","https://openalex.org/W1987608226","https://openalex.org/W2111868903"],"abstract_inverted_index":{"Wheeler":[0,109],"DFAs":[1],"(WDFAs)":[2],"are":[3],"a":[4,72,126,165],"sub-class":[5],"of":[6,19,53,102,152,158,167],"finite-state":[7,75],"automata":[8],"which":[9,87,111],"is":[10,65,71,80],"playing":[11],"an":[12,150],"important":[13,59],"role":[14],"in":[15,32,89,133],"the":[16,40,50,54,68,78,83,100,103,121,156],"emerging":[17],"field":[18],"compressed":[20],"data":[21],"structures:":[22],"as":[23],"opposed":[24],"to":[25,61,125,162],"general":[26,73],"automata,":[27],"WDFAs":[28,144],"can":[29,130],"be":[30,131],"stored":[31],"just":[33],"<tex>$\\log\\sigma+O(1)$</tex>":[34],"bits":[35],"per":[36,173],"edge,":[37],"<tex>$\\sigma$</tex>":[38],"being":[39],"alphabet&#x0027;s":[41],"size,":[42],"and":[43],"support":[44],"optimal-time":[45],"pattern":[46],"matching":[47],"queries":[48],"on":[49,141],"substring":[51],"closure":[52],"language":[55],"they":[56],"recognize.":[57],"An":[58],"step":[60],"achieve":[62],"further":[63],"compression":[64],"minimization.":[66],"When":[67,139],"input":[69,128],"<tex>$\\mathcal{A}$</tex>":[70],"deterministic":[74],"automaton":[76],"(DFA),":[77],"state-of-the-art":[79],"represented":[81],"by":[82],"classic":[84],"Hopcroft&#x0027;s":[85],"algorithm,":[86],"runs":[88],"<tex>$O(\\vert":[90,135],"\\mathcal{A}\\vert":[91,93,136],"\\log\\vert":[92],")$</tex>":[94,137],"time.":[95,138],"This":[96],"algorithm":[97,107,154],"stands":[98],"at":[99,164],"core":[101],"only":[104],"existing":[105],"minimization":[106],"for":[108],"DFAs,":[110],"inherits":[112],"its":[113],"complexity.":[114],"In":[115],"this":[116],"work,":[117],"we":[118],"show":[119],"that":[120],"minimum":[122],"WDFA":[123,129],"equivalent":[124],"given":[127],"computed":[132],"linear":[134],"run":[140],"de":[142],"Bruijn":[143],"built":[145],"from":[146,160],"real":[147],"DNA":[148],"datasets,":[149],"implementation":[151],"our":[153],"reduces":[155],"number":[157],"nodes":[159,172],"14&#x0025;":[161],"51&#x0025;":[163],"speed":[166],"more":[168],"than":[169],"1":[170],"million":[171],"second.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-11-08T00:00:00"}