A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata

摘要

In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a denite set of words. Such automata are useful in a wide variety of applications, including computer virus detection, computation