Cycle-aware minimization of acyclic deterministic finite-state automata
- In this paper a linear-time algorithm for the minimization of acyclic deterministic finite-state automata is presented. The algorithm runs significantly faster than previous algorithms for the same task. This is shown by a comparison of the running times of both algorithms. Additionally, a variation of the new algorithm is presented which handles cyclic automata as input. The new cycle-aware algorithm minimizes acyclic automata in the desired way. In case of cyclic input, the algorithm minimizes all acyclic suffixes of the input automaton.
| Author details: | Johannes Bubenzer |
|---|---|
| DOI: | https://doi.org/10.1016/j.dam.2013.08.003 |
| ISSN: | 0166-218X |
| ISSN: | 1872-6771 |
| Title of parent work (English): | Discrete applied mathematics |
| Publisher: | Elsevier |
| Place of publishing: | Amsterdam |
| Publication type: | Article |
| Language: | English |
| Year of first publication: | 2014 |
| Publication year: | 2014 |
| Release date: | 2017/03/27 |
| Tag: | Algorithmic; Deterministic finite state automata; Minimization |
| Volume: | 163 |
| Number of pages: | 9 |
| First page: | 238 |
| Last Page: | + |
| Organizational units: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Mathematik |
| Peer review: | Referiert |
