{"id":"https://openalex.org/W2099747032","doi":"https://doi.org/10.1016/s0167-6423(03)00012-1","title":"A new algorithm for the construction of minimal acyclic DFAs","display_name":"A new algorithm for the construction of minimal acyclic DFAs","publication_year":2003,"publication_date":"2003-06-09","ids":{"openalex":"https://openalex.org/W2099747032","doi":"https://doi.org/10.1016/s0167-6423(03)00012-1","mag":"2099747032"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6423(03)00012-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6423(03)00012-1","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","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/A5027422026","display_name":"Bruce W. Watson","orcid":"https://orcid.org/0000-0003-0511-1837"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Bruce W. Watson","raw_affiliation_strings":["Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa and FST Labs & Ribbit Software Systems Inc., Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria 0002, South Africa and FST Labs & Ribbit Software Systems Inc., Canada#TAB#","institution_ids":["https://openalex.org/I69552723"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027422026"],"corresponding_institution_ids":["https://openalex.org/I69552723"],"apc_list":{"value":2460,"currency":"USD","value_usd":2460},"apc_paid":null,"fwci":0.7269,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.72285044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"48","issue":"2-3","first_page":"81","last_page":"97"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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.9948999881744385,"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/computer-science","display_name":"Computer science","score":0.9095927476882935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5957134962081909},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.41236215829849243}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9095927476882935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5957134962081909},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.41236215829849243}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0167-6423(03)00012-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6423(03)00012-1","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/77df623b-845d-4778-b3e5-066f178501c3","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/77df623b-845d-4778-b3e5-066f178501c3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Watson, B W 2003, 'A new algorithm for the construction of minimal acyclic DFAs', Science of Computer Programming, vol. 48, no. 2-3, pp. 81-97. https://doi.org/10.1016/S0167-6423(03)00012-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:library.tue.nl:623646","is_oa":false,"landing_page_url":"http://repository.tue.nl/623646","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-6423","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/77df623b-845d-4778-b3e5-066f178501c3","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/77df623b-845d-4778-b3e5-066f178501c3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Science of Computer Programming, 48(2-3), 81 - 97. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W182831726","https://openalex.org/W210801244","https://openalex.org/W1490430289","https://openalex.org/W1491178396","https://openalex.org/W1493925387","https://openalex.org/W1494055011","https://openalex.org/W1526015812","https://openalex.org/W1549741590","https://openalex.org/W1551265161","https://openalex.org/W1579838312","https://openalex.org/W1585070348","https://openalex.org/W1660390307","https://openalex.org/W1989111810","https://openalex.org/W1990061958","https://openalex.org/W2002089154","https://openalex.org/W2026551868","https://openalex.org/W2044309072","https://openalex.org/W2048895380","https://openalex.org/W2049008702","https://openalex.org/W2070830131","https://openalex.org/W2103953153","https://openalex.org/W2106583644","https://openalex.org/W2123135686","https://openalex.org/W2150229269","https://openalex.org/W2154478838","https://openalex.org/W2495921853","https://openalex.org/W2565555751","https://openalex.org/W2611477341","https://openalex.org/W2950053197","https://openalex.org/W4302339081","https://openalex.org/W6629404110","https://openalex.org/W6631370932","https://openalex.org/W6662767684","https://openalex.org/W6675902653"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W4302345037","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2952978498","https://openalex.org/W2951616510","https://openalex.org/W1998712144","https://openalex.org/W2390279801"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}