{"id":"https://openalex.org/W2088806988","doi":"https://doi.org/10.1142/s0129054103002187","title":"A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES","display_name":"A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W2088806988","doi":"https://doi.org/10.1142/s0129054103002187","mag":"2088806988"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054103002187","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002187","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5054378107","display_name":"Heiko K\u00f6rner","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127969","display_name":"Sch\u00f6n Klinik Neustadt","ror":"https://ror.org/02devh349","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I4210088209","https://openalex.org/I4210127969"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"HEIKO K\u00d6RNER","raw_affiliation_strings":["Wallgasse 14,  D\u201367433 Neustadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wallgasse 14,  D\u201367433 Neustadt, Germany","institution_ids":["https://openalex.org/I4210127969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054378107"],"corresponding_institution_ids":["https://openalex.org/I4210127969"],"apc_list":null,"apc_paid":null,"fwci":1.4401,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.82235917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"06","first_page":"1071","last_page":"1086"},"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/T12029","display_name":"DNA and Biological Computing","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.996399998664856,"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/cover","display_name":"Cover (algebra)","score":0.7584787607192993},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7552487850189209},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7077794075012207},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6841760277748108},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.682269275188446},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.6507291793823242},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5981742143630981},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.578116774559021},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5706557035446167},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5395736694335938},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5275739431381226},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4795948565006256},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.479248046875},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4678042232990265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4578820765018463},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45211610198020935},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44054800271987915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42771556973457336},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.27920815348625183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22204115986824036}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7584787607192993},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7552487850189209},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7077794075012207},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6841760277748108},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.682269275188446},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.6507291793823242},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5981742143630981},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.578116774559021},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5706557035446167},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5395736694335938},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5275739431381226},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4795948565006256},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.479248046875},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4678042232990265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4578820765018463},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45211610198020935},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44054800271987915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42771556973457336},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.27920815348625183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22204115986824036},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054103002187","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054103002187","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.315","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.315","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-mmdb.iai.uni-bonn.de/./download/publications/heiko.koerner/IJFSC-mca.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1529714626","https://openalex.org/W1993598446","https://openalex.org/W2002089154","https://openalex.org/W2037872771","https://openalex.org/W2122493035","https://openalex.org/W2752885492","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2037872771","https://openalex.org/W1990283467","https://openalex.org/W2139519154","https://openalex.org/W1987608226","https://openalex.org/W1983100634","https://openalex.org/W2243509623","https://openalex.org/W2171377051","https://openalex.org/W2462239665","https://openalex.org/W2124370744"],"abstract_inverted_index":{"A":[0],"deterministic":[1],"finite":[2,16,87],"automaton":[3,12],"(DFA)":[4],"[Formula:":[5,24,55,60],"see":[6,25,56,61],"text]":[7,62],"is":[8,44,63,145,156],"called":[9],"a":[10,15,39,91],"cover":[11],"(DFCA)":[13],"for":[14,68,85],"language":[17,88,154],"L":[18,46,69,89],"over":[19],"some":[20,33,86],"alphabet":[21],"\u03a3":[22],"if":[23,47,50,65],"text],":[26],"with":[27],"l":[28,53],"being":[29],"the":[30,117,129,141,151],"length":[31],"of":[32],"longest":[34],"word":[35,40],"in":[36,45,150],"L.":[37],"Thus":[38],"w":[41],"\u2208":[42],"\u03a3*":[43],"and":[48,54,101,114,138],"only":[49,96],"|w|":[51],"\u2264":[52],"text].":[57],"The":[58,104],"DFCA":[59,67],"minimal":[64,93],"no":[66],"has":[70],"fewer":[71],"states.":[72],"In":[73],"this":[74],"paper,":[75],"we":[76],"present":[77],"an":[78,82,148],"algorithm":[79,108,119],"which":[80],"converts":[81],"n\u2013state":[83],"DFA":[84],"into":[90],"corresponding":[92],"DFCA,":[94,127],"using":[95],"O(n":[97,110,134],"log":[98],"n)":[99],"time":[100,113,137],"O(n)":[102],"space.":[103,115,139],"best":[105,130],"previously":[106],"known":[107],"requires":[109],"2":[111],")":[112,136],"Furthermore,":[116],"new":[118],"can":[120],"also":[121,157],"be":[122],"used":[123],"to":[124],"minimize":[125],"any":[126],"where":[128],"previous":[131],"method":[132],"takes":[133],"4":[135],"Since":[140],"required":[142],"data":[143],"structure":[144],"rather":[146],"complex,":[147],"implementation":[149],"common":[152],"programming":[153],"C/C++":[155],"provided.":[158]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}