×

zbMATH — the first resource for mathematics

Incremental construction of minimal acyclic finite-state automata. (English) Zbl 1232.68081
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. Our method is fast and significantly lowers memory requirements in comparison to other methods.

MSC:
68Q45 Formal languages and automata
91F20 Linguistics
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Revuz Dominique, LITP 91 pp 44– (1991)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.