{"id":"https://openalex.org/W2396694954","doi":"https://doi.org/10.1201/b13055-12","title":"Finite Automata Minimization","display_name":"Finite Automata Minimization","publication_year":2012,"publication_date":"2012-11-29","ids":{"openalex":"https://openalex.org/W2396694954","doi":"https://doi.org/10.1201/b13055-12","mag":"2396694954"},"language":"en","primary_location":{"id":"doi:10.1201/b13055-12","is_oa":false,"landing_page_url":"https://doi.org/10.1201/b13055-12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Finite State Based Models and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5088043702","display_name":"Marco Almeida","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marco Almeida","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050789330","display_name":"Nelma Moreira","orcid":"https://orcid.org/0000-0003-0861-0105"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nelma Moreira","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101616511","display_name":"Rog\u00e9rio Reis","orcid":"https://orcid.org/0000-0001-9668-0917"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rog\u00e9rio Reis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088043702"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8162,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.84525277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"157","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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.9987999796867371,"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.9930999875068665,"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.9912999868392944,"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/minification","display_name":"Minification","score":0.6478129625320435},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.5787046551704407},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5667532682418823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5021836757659912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3271506428718567},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2636399269104004},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.19833287596702576},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.19382956624031067},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14905789494514465}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6478129625320435},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.5787046551704407},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5667532682418823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5021836757659912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3271506428718567},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2636399269104004},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.19833287596702576},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.19382956624031067},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14905789494514465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/b13055-12","is_oa":false,"landing_page_url":"https://doi.org/10.1201/b13055-12","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Finite State Based Models and Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W1655990431"],"related_works":["https://openalex.org/W1500848375","https://openalex.org/W2155192172","https://openalex.org/W2076634344","https://openalex.org/W2350141075","https://openalex.org/W2043268408","https://openalex.org/W2075835272","https://openalex.org/W2025253173","https://openalex.org/W2315419748","https://openalex.org/W3094407054","https://openalex.org/W2514467550"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,22,70,93,100],"finding":[3],"the":[4,17,20,47,68,78,82,91,94],"minimal":[5],"DFA":[6],"equivalent":[7],"to":[8,16,42],"a":[9,44],"given":[10],"automaton":[11],"can":[12],"be":[13],"traced":[14],"back":[15],"1950s":[18],"with":[19],"works":[21],"Huffman":[23],"(1954,":[24],"1955)":[25],"and":[26,39],"Moore":[27],"(1956).":[28],"Having":[29],"applications":[30],"on":[31,67],"compiler":[32],"construction,":[33],"pattern":[34],"matching,":[35],"hardware":[36],"circuit":[37],"minimization,":[38],"XML":[40],"processing":[41],"name":[43],"few,":[45],"over":[46],"years":[48],"several":[49,72],"alternative":[50],"(and":[51],"increasingly":[52],"efficient)":[53],"algorithms":[54],"have":[55],"been":[56],"proposed.":[57],"Although":[58],"they":[59],"all":[60,98],"depend":[61],"upon":[62],"computing":[63,77,81,90],"an":[64],"equivalence":[65,79,95],"relation":[66,96],"set":[69],"states,":[71],"approaches":[73],"are":[74],"possible:":[75],"explicitly":[76],"relation,":[80],"partition":[83],"(of":[84],"states)":[85],"that":[86],"it":[87],"induces,":[88],"or":[89],"complement":[92],"(finding":[97],"pairs":[99],"distinguishable":[101],"states).":[102]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}
