Refine
Has Fulltext
- no (1)
Year of publication
- 2014 (1) (remove)
Document Type
- Article (1) (remove)
Language
- English (1) (remove)
Is part of the Bibliography
- yes (1)
Keywords
- Deterministic finite state automata (1) (remove)
Institute
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.