Incremental construction of minimal acyclic finite-state automata
Abstract
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2000
- DOI:
- 10.48550/arXiv.cs/0007009
- arXiv:
- arXiv:cs/0007009
- Bibcode:
- 2000cs........7009D
- Keywords:
-
- Computation and Language;
- I.2.7
- E-Print:
- 14 pages, 7 figures