{"id":"https://openalex.org/W2615308287","doi":"https://doi.org/10.1142/s0129054117500150","title":"More on Minimizing Finite Automata with Errors \u2014 Nondeterministic Machines","display_name":"More on Minimizing Finite Automata with Errors \u2014 Nondeterministic Machines","publication_year":2017,"publication_date":"2017-04-01","ids":{"openalex":"https://openalex.org/W2615308287","doi":"https://doi.org/10.1142/s0129054117500150","mag":"2615308287"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500150","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500150","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/A5051371872","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":0,"citation_normalized_percentile":{"value":0.08030514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"03","first_page":"229","last_page":"245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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/T10142","display_name":"Formal Methods in Verification","score":0.9829999804496765,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8186943531036377},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.7794018983840942},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7618064880371094},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.7376729846000671},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6762734055519104},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6743351817131042},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6311803460121155},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.535611093044281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.535525918006897},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.510216236114502},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4385581314563751},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43454962968826294},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3820315897464752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3714369535446167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36257660388946533},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.30410686135292053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2881960868835449},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18066248297691345}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8186943531036377},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.7794018983840942},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7618064880371094},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.7376729846000671},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6762734055519104},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6743351817131042},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6311803460121155},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.535611093044281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.535525918006897},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.510216236114502},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4385581314563751},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43454962968826294},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3820315897464752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3714369535446167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36257660388946533},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30410686135292053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2881960868835449},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18066248297691345}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054117500150","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500150","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1982129592","https://openalex.org/W1982206794","https://openalex.org/W1988572171","https://openalex.org/W1989148126","https://openalex.org/W2002922589","https://openalex.org/W2008342226","https://openalex.org/W2040834199","https://openalex.org/W2057653105","https://openalex.org/W2090431024"],"related_works":["https://openalex.org/W2136740376","https://openalex.org/W2810776027","https://openalex.org/W2037872771","https://openalex.org/W2030569822","https://openalex.org/W1987608226","https://openalex.org/W2111868903","https://openalex.org/W1560450186","https://openalex.org/W2139519154","https://openalex.org/W2772918710","https://openalex.org/W72746997"],"abstract_inverted_index":{"We":[0,33],"continue":[1],"our":[2],"research":[3],"on":[4,58,72],"minimization":[5,37],"problems":[6,9,38,43],"and":[7,31,39,62],"related":[8],"for":[10],"automata":[11,21],"w.r.t.":[12],"to":[13,54,67],"different":[14],"error":[15,27],"profiles,":[16],"now":[17],"considering":[18],"nondeterministic":[19],"finite":[20,74],"(NFAs)":[22],"as":[23],"inputs.":[24],"Here":[25],"the":[26,36,55,68],"profiles":[28],"are":[29],"almost-equivalence":[30],"E-equivalence.":[32],"show":[34,63],"that":[35],"their":[40],"underlying":[41],"equivalence":[42],"become":[44],"PSPACE-complete":[45],"in":[46],"most":[47],"cases.":[48],"The":[49],"obtained":[50,70],"results":[51,71],"nicely":[52],"fit":[53],"known":[56],"ones":[57],"ordinary":[59],"NFA":[60],"minimization,":[61],"a":[64],"significant":[65],"difference":[66],"previously":[69],"deterministic":[73],"state":[75],"machines.":[76]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}