{"id":"https://openalex.org/W2057653105","doi":"https://doi.org/10.1142/s0129054113400327","title":"FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS","display_name":"FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2057653105","doi":"https://doi.org/10.1142/s0129054113400327","mag":"2057653105"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400327","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400327","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":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","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, Arndtstr. 2, 35392 Giessen, Germany"],"raw_orcid":null,"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":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","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"],"raw_orcid":null,"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":1.4581,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82507755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"07","first_page":"1083","last_page":"1097"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.8239297866821289},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7014459371566772},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5865644812583923},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.5510620474815369},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49518242478370667},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.48164668679237366},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4635341167449951},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4319513142108917},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4279889464378357},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3479236364364624},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2859766185283661},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20006898045539856},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1719180941581726}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8239297866821289},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7014459371566772},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5865644812583923},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.5510620474815369},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49518242478370667},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.48164668679237366},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4635341167449951},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4319513142108917},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4279889464378357},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3479236364364624},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2859766185283661},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20006898045539856},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1719180941581726},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113400327","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400327","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":"Reduced inequalities","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1590283810","https://openalex.org/W1980967952","https://openalex.org/W1984509356","https://openalex.org/W1988572171","https://openalex.org/W1989148126","https://openalex.org/W1989887898","https://openalex.org/W1993180032","https://openalex.org/W2006912660","https://openalex.org/W2043360684","https://openalex.org/W2049316103","https://openalex.org/W2090431024","https://openalex.org/W2115826669","https://openalex.org/W2156595559"],"related_works":["https://openalex.org/W2030569822","https://openalex.org/W2088578754","https://openalex.org/W3143588635","https://openalex.org/W1843639509","https://openalex.org/W2000290048","https://openalex.org/W888262983","https://openalex.org/W11319064","https://openalex.org/W1606484542","https://openalex.org/W1890357466","https://openalex.org/W1560450186"],"abstract_inverted_index":{"We":[0,55],"introduce":[1],"E-equivalence,":[2],"which":[3],"is":[4,59],"a":[5,18,32,60],"straightforward":[6],"generalization":[7],"of":[8,21,39,66,97,101],"almost-equivalence.":[9],"While":[10],"almost-equivalence":[11],"asks":[12],"for":[13,90],"ordinary":[14],"equivalence":[15],"up":[16],"to":[17,31,69,74,87],"finite":[19,41],"number":[20,100],"exceptions,":[22],"in":[23,63],"E-equivalence":[24,52],"these":[25,102],"exceptions":[26],"or":[27],"errors":[28],"must":[29],"belong":[30],"(regular)":[33],"set":[34],"E.":[35],"The":[36],"computational":[37],"complexity":[38,65],"deterministic":[40],"automata":[42,81],"(DFAs)":[43],"minimization":[44],"problems":[45,67],"and":[46,51,71,79],"their":[47],"variants":[48],"w.r.t.":[49],"almost-":[50],"are":[53,82],"studied.":[54],"show":[56],"that":[57],"there":[58],"significant":[61],"difference":[62],"the":[64,95,99],"related":[68,73],"almost-equivalence,":[70],"those":[72],"E-equivalence.":[75],"Moreover,":[76],"since":[77],"hyper-minimal":[78],"E-minimal":[80],"not":[83],"necessarily":[84],"unique":[85],"(up":[86],"isomorphism":[88],"as":[89],"minimal":[91,103],"DFAs),":[92],"we":[93],"consider":[94],"problem":[96],"counting":[98],"automata.":[104]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}