A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
| dc.creator | Watson,Bruce | |
| dc.date | 2002 | |
| dc.date.accessioned | 2024-02-06T12:51:41Z | |
| dc.date.available | 2024-02-06T12:51:41Z | |
| dc.description | In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a denite set of words. Such automata are useful in a wide variety of applications, including computer virus detection, computational linguistics and computational genetics. There are several known algorithms that solve the same problem, though most of the alternative algorithms are considerably more difficult to present, understand and implement than the one given here. Preliminary benchmarking indicates that the algorithm presented here is competitive with the other known algorithms. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-008-02-0363 | |
| dc.identifier | https://lib.jucs.org/article/27865/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8117 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 8(2): 363-367 | |
| dc.subject | minimal acyclic deterministic finite automata | |
| dc.subject | automata construction algorithms | |
| dc.title | A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata | |
| dc.type | Research Article |