{"id":"https://openalex.org/W2796797028","doi":"https://doi.org/10.1142/s0129054118400063","title":"Minimal Reversible Deterministic Finite Automata","display_name":"Minimal Reversible Deterministic Finite Automata","publication_year":2018,"publication_date":"2018-02-01","ids":{"openalex":"https://openalex.org/W2796797028","doi":"https://doi.org/10.1142/s0129054118400063","mag":"2796797028"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118400063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118400063","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/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Holzer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse\u00a02, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse\u00a02, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056800220","display_name":"Sebastian Jakobi","orcid":null},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Jakobi","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse\u00a02, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse\u00a02, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Kutrib","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse\u00a02, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstrasse\u00a02, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026803820"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":1.6155,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.85176049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"02","first_page":"251","last_page":"270"},"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/T12072","display_name":"Machine Learning and Algorithms","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/T12029","display_name":"DNA and Biological Computing","score":0.996399998664856,"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/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.7465760707855225},{"id":"https://openalex.org/keywords/injective-function","display_name":"Injective function","score":0.5816811323165894},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.5420374274253845},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5420327186584473},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5300713777542114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5221372246742249},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5217036604881287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4707888960838318},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.4686151146888733},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.44619518518447876},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.41730350255966187},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40094655752182007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.369577020406723},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3211732506752014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3081556558609009},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19957399368286133},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.14133033156394958}],"concepts":[{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.7465760707855225},{"id":"https://openalex.org/C128107574","wikidata":"https://www.wikidata.org/wiki/Q182003","display_name":"Injective function","level":2,"score":0.5816811323165894},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.5420374274253845},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5420327186584473},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5300713777542114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5221372246742249},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5217036604881287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4707888960838318},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.4686151146888733},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.44619518518447876},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.41730350255966187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40094655752182007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.369577020406723},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3211732506752014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3081556558609009},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19957399368286133},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.14133033156394958},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054118400063","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118400063","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W124851435","https://openalex.org/W159651414","https://openalex.org/W1590283810","https://openalex.org/W1988572171","https://openalex.org/W2012539169","https://openalex.org/W2043360684","https://openalex.org/W2055809970","https://openalex.org/W2092386826","https://openalex.org/W2092883162","https://openalex.org/W2105259569","https://openalex.org/W2160728288","https://openalex.org/W2183328018","https://openalex.org/W4233798822","https://openalex.org/W4301662502"],"related_works":["https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W1987608226","https://openalex.org/W2772918710","https://openalex.org/W1968608348","https://openalex.org/W2111868903","https://openalex.org/W4308880995","https://openalex.org/W2488819432","https://openalex.org/W4246705858","https://openalex.org/W2462239665"],"abstract_inverted_index":{"We":[0,31],"study":[1],"reversible":[2],"deterministic":[3,10,59],"finite":[4,11],"automata":[5,12],"(REV-DFAs),":[6],"that":[7,39,71,131],"are":[8,140],"partial":[9],"whose":[13],"transition":[14],"function":[15],"induces":[16],"an":[17],"injective":[18],"mapping":[19],"on":[20,49,120],"the":[21,28,50,57,72,103,121,135],"state":[22,60],"set":[23],"for":[24,106],"every":[25],"letter":[26],"of":[27,36,52,74,137],"input":[29],"alphabet.":[30],"give":[32,87],"a":[33,53,64,107],"structural":[34],"characterization":[35,46],"regular":[37],"languages":[38],"can":[40,80],"be":[41,81],"accepted":[42],"by":[43],"REV-DFAs.":[44,126],"This":[45],"is":[47],"based":[48],"absence":[51],"forbidden":[54,65,84],"pattern":[55,66,85],"in":[56],"(minimal)":[58],"graph.":[61],"Again":[62],"with":[63],"approach,":[67],"we":[68],"also":[69],"show":[70],"minimality":[73],"REV-DFAs":[75,79,139],"among":[76],"all":[77,129],"equivalent":[78],"decided.":[82],"Both":[83],"characterizations":[86],"rise":[88],"to":[89,101,114,125],"[Formula:":[90],"see":[91],"text]-complete":[92],"decision":[93],"algorithms.":[94],"In":[95],"fact,":[96],"our":[97],"techniques":[98],"allow":[99],"us":[100],"construct":[102],"minimal":[104,109,138],"REV-DFA":[105],"given":[108],"DFA.":[110],"These":[111],"considerations":[112],"lead":[113],"asymptotic":[115],"upper":[116],"and":[117,134],"lower":[118],"bounds":[119],"conversion":[122],"from":[123],"DFAs":[124],"Thus,":[127],"almost":[128],"problems":[130],"concern":[132],"uniqueness":[133],"size":[136],"solved.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}