{"id":"https://openalex.org/W3022901100","doi":"https://doi.org/10.1142/s0129054116400050","title":"Minimal and Hyper-Minimal Biautomata","display_name":"Minimal and Hyper-Minimal Biautomata","publication_year":2016,"publication_date":"2016-02-01","ids":{"openalex":"https://openalex.org/W3022901100","doi":"https://doi.org/10.1142/s0129054116400050","mag":"3022901100"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054116400050","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116400050","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":true,"raw_author_name":"Markus Holzer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","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 Arndtstr. 2, 35392 Giessen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016664760"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.25626732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"27","issue":"02","first_page":"161","last_page":"185"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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/minification","display_name":"Minification","score":0.6557204127311707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6103368997573853},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5554599761962891},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5303519368171692},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46663743257522583},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4347268044948578},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.41406750679016113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3798954486846924},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3783128261566162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3523232340812683},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25260311365127563},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.21328386664390564},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.19024550914764404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15400400757789612}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6557204127311707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6103368997573853},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5554599761962891},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5303519368171692},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46663743257522583},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4347268044948578},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.41406750679016113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3798954486846924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3783128261566162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3523232340812683},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25260311365127563},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.21328386664390564},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.19024550914764404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15400400757789612},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054116400050","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054116400050","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1590283810","https://openalex.org/W1980967952","https://openalex.org/W1988572171","https://openalex.org/W1989887898","https://openalex.org/W2000290048","https://openalex.org/W2043360684","https://openalex.org/W2057653105","https://openalex.org/W2090431024","https://openalex.org/W2156429182","https://openalex.org/W2169359757"],"related_works":["https://openalex.org/W2155192172","https://openalex.org/W2076634344","https://openalex.org/W1500848375","https://openalex.org/W2350141075","https://openalex.org/W2043268408","https://openalex.org/W2315419748","https://openalex.org/W3094407054","https://openalex.org/W1594653033","https://openalex.org/W1876530482","https://openalex.org/W2610542549"],"abstract_inverted_index":{"We":[0],"compare":[1],"deterministic":[2],"finite":[3],"automata":[4],"(DFAs)":[5],"and":[6,17,20,26,41],"biautomata":[7,68],"under":[8],"the":[9,24,32,44,51,59,63],"following":[10],"two":[11],"aspects:":[12],"structural":[13],"similarities":[14],"between":[15,38,65,76],"minimal":[16,39],"hyper-minimal":[18,67,78],"automata,":[19],"computational":[21],"complexity":[22],"of":[23,43],"minimization":[25,46],"hyper-minimization":[27,82],"problem.":[28],"Concerning":[29],"classical":[30],"minimality,":[31],"known":[33],"results":[34],"such":[35],"as":[36,71,73],"isomorphism":[37],"DFAs,":[40,86],"NL-completeness":[42],"DFA":[45],"problem":[47,91],"carry":[48],"over":[49],"to":[50,94],"biautomaton":[52],"case.":[53],"But":[54],"surprisingly":[55],"this":[56,90],"is":[57,69,75,83],"not":[58,70],"case":[60],"for":[61,85,100],"hyper-minimization:":[62],"similarity":[64],"almost-equivalent":[66,77],"strong":[72],"it":[74],"DFAs.":[79],"Moreover,":[80],"while":[81],"NL-complete":[84],"we":[87],"prove":[88],"that":[89],"turns":[92],"out":[93],"be":[95],"computationally":[96],"intractable,":[97],"i.e.,":[98],"NP-complete,":[99],"biautomata.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}