{"id":"https://openalex.org/W1979078717","doi":"https://doi.org/10.1145/2429069.2429079","title":"Advanced automata minimization","display_name":"Advanced automata minimization","publication_year":2013,"publication_date":"2013-01-22","ids":{"openalex":"https://openalex.org/W1979078717","doi":"https://doi.org/10.1145/2429069.2429079","mag":"1979078717"},"language":"en","primary_location":{"id":"doi:10.1145/2429069.2429079","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"preprint","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/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom","University of Edinburgh, edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074542253","display_name":"Lorenzo Clemente","orcid":"https://orcid.org/0000-0003-0578-9103"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lorenzo Clemente","raw_affiliation_strings":["LaBRI, University of Bordeaux I, Bordeaux, France"],"affiliations":[{"raw_affiliation_string":"LaBRI, University of Bordeaux I, Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082358544"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":4.92585411,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96072984,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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.7801226377487183},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7245005369186401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6670684814453125},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6330833435058594},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5542459487915039},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5443410873413086},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49959754943847656},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4877220094203949},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.4796876609325409},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.46333256363868713},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.4607563614845276},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.44129419326782227},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.437059611082077},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.4109095633029938},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4100008010864258},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35933977365493774},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.33544227480888367},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.28166237473487854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.27258163690567017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2690483033657074}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7801226377487183},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7245005369186401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6670684814453125},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6330833435058594},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5542459487915039},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5443410873413086},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49959754943847656},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4877220094203949},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.4796876609325409},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.46333256363868713},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.4607563614845276},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.44129419326782227},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.437059611082077},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.4109095633029938},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4100008010864258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35933977365493774},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.33544227480888367},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.28166237473487854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27258163690567017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2690483033657074},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2429069.2429079","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00949520v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00949520","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc. of POPL'13, Jan 2013, Rome, Italy. pp.63--74, ⟨10.1145/2429069.2429079⟩","raw_type":"Conference papers"},{"id":"pmh:oai:pure.ed.ac.uk:publications/46fe6839-814c-4d60-a331-6555d8a53c86","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/46fe6839-814c-4d60-a331-6555d8a53c86","pdf_url":null,"source":{"id":"https://openalex.org/S4306400320","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5899999737739563,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W143291542","https://openalex.org/W652339031","https://openalex.org/W1480621838","https://openalex.org/W1497805930","https://openalex.org/W1505262931","https://openalex.org/W1507116188","https://openalex.org/W1539432158","https://openalex.org/W1543741569","https://openalex.org/W1548996544","https://openalex.org/W1550751956","https://openalex.org/W1566259690","https://openalex.org/W1585581063","https://openalex.org/W1605860947","https://openalex.org/W1696271966","https://openalex.org/W1841354836","https://openalex.org/W1964680921","https://openalex.org/W1965244712","https://openalex.org/W1965927648","https://openalex.org/W1976773489","https://openalex.org/W1993129359","https://openalex.org/W2045235791","https://openalex.org/W2076334860","https://openalex.org/W2085653536","https://openalex.org/W2089003125","https://openalex.org/W2098817244","https://openalex.org/W2106388690","https://openalex.org/W2107182799","https://openalex.org/W2148195254","https://openalex.org/W2157768805","https://openalex.org/W2163945092","https://openalex.org/W2165726630","https://openalex.org/W2312425605","https://openalex.org/W2488696175","https://openalex.org/W2503469005","https://openalex.org/W2741432134","https://openalex.org/W2914000465","https://openalex.org/W2952544431","https://openalex.org/W3141536691","https://openalex.org/W3204486483","https://openalex.org/W6605806299","https://openalex.org/W6632383594","https://openalex.org/W6638705559","https://openalex.org/W6672608052"],"related_works":["https://openalex.org/W2030569822","https://openalex.org/W3143588635","https://openalex.org/W309405200","https://openalex.org/W2050777932","https://openalex.org/W4205935260","https://openalex.org/W2037872771","https://openalex.org/W1987608226","https://openalex.org/W2124370744","https://openalex.org/W2462239665","https://openalex.org/W2063230375"],"abstract_inverted_index":{"International":[0],"audience":[1]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}