{"id":"https://openalex.org/W2106583644","doi":"https://doi.org/10.3217/jucs-008-02-0363","title":"A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata","display_name":"A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata","publication_year":2020,"publication_date":"2020-04-07","ids":{"openalex":"https://openalex.org/W2106583644","doi":"https://doi.org/10.3217/jucs-008-02-0363","mag":"2106583644"},"language":"en","primary_location":{"id":"pmh:oai:pure.tue.nl:openaire/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Watson, B W 2002, 'A fast and simple algorithm for constructing minimal acyclic deterministic finite automata', Journal of Universal Computer Science, vol. 8, no. 2, pp. 363-367. https://doi.org/10.3217/jucs-008-02-0363","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080455417","display_name":"BW Bruce Watson","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bruce W. Watson","raw_affiliation_strings":["Software Engineering and Technology"],"affiliations":[{"raw_affiliation_string":"Software Engineering and Technology","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080455417"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2889,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.59453348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9997000098228455,"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/T12029","display_name":"DNA and Biological Computing","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9976000189781189,"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/simple","display_name":"Simple (philosophy)","score":0.7412837147712708},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5933071374893188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5847955346107483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5840612649917603},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5561417937278748},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5208566784858704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.297485888004303}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7412837147712708},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5933071374893188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5847955346107483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5840612649917603},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5561417937278748},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5208566784858704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.297485888004303},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"pmh:oai:pure.tue.nl:openaire/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Watson, B W 2002, 'A fast and simple algorithm for constructing minimal acyclic deterministic finite automata', Journal of Universal Computer Science, vol. 8, no. 2, pp. 363-367. https://doi.org/10.3217/jucs-008-02-0363","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:zenodo.org:6996141","is_oa":true,"landing_page_url":"https://zenodo.org/record/6996141","pdf_url":"https://zenodo.org/record/6996141","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 8((2)) 363-367","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","pdf_url":"https://research.tue.nl/nl/publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Universal Computer Science, 8(2), 363 - 367. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:623850","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623850","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:0948-6912 0948-695X 0958-695X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.5618","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.5618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_8_2/a_fast_and_simple/Watson_B_W.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:623850","is_oa":false,"landing_page_url":"http://repository.tue.nl/623850","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:0948-6912 0948-695X 0958-695X","raw_type":"Article / Letter to the editor"},{"id":"doi:10.3217/jucs-008-02-0363","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-008-02-0363","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/db9e1cc9-37b0-47e7-b48f-cf827bf3ff71","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Watson, B W 2002, 'A fast and simple algorithm for constructing minimal acyclic deterministic finite automata', Journal of Universal Computer Science, vol. 8, no. 2, pp. 363-367. https://doi.org/10.3217/jucs-008-02-0363","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2002089154"],"related_works":["https://openalex.org/W1428391281","https://openalex.org/W2355522437","https://openalex.org/W2111868903","https://openalex.org/W127357700","https://openalex.org/W4281261571","https://openalex.org/W2724597727","https://openalex.org/W1480528870","https://openalex.org/W2508541108","https://openalex.org/W3087272834","https://openalex.org/W4312340169"],"abstract_inverted_index":{"Abstract:":[0],"In":[1],"this":[2],"paper,":[3],"we":[4],"present":[5],"a":[6,13,20,30],"fast":[7],"and":[8,41,67],"simple":[9],"algorithm":[10,79],"for":[11],"constructing":[12],"minimal":[14,91],"acyclic":[15,92],"deterministic":[16,93],"finite":[17,21,94],"automaton":[18],"from":[19],"set":[22],"of":[23,33,56],"words.":[24],"Such":[25],"automata":[26,96],"are":[27,45,60],"useful":[28],"in":[29],"wide":[31],"variety":[32],"applications,":[34],"including":[35],"computer":[36],"virus":[37],"detection,":[38],"computational":[39,42],"linguistics":[40],"genetics.":[43],"There":[44],"several":[46],"known":[47,87],"algorithms":[48,59,98],"that":[49,77],"solve":[50],"the":[51,57,70,78,85],"same":[52],"problem,":[53],"though":[54],"most":[55],"alternative":[58],"considerably":[61],"more":[62],"difficult":[63],"to":[64],"present,":[65],"understand":[66],"implement":[68],"than":[69],"one":[71],"given":[72],"here.":[73],"Preliminary":[74],"benchmarking":[75],"indicates":[76],"presented":[80],"here":[81],"is":[82],"competitive":[83],"with":[84],"other":[86],"algorithms.":[88],"Key":[89],"Words:":[90],"automata,":[95],"construction":[97],"Category:":[99],"F.1.1":[100]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}