Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated.