Computing Small Nondeterministic Finite Automata
In TACAS, pages
The minimization problem for nondeterministic finite automata
is studied. Two approaches are discussed, based on the construction of two
versions of ``canonical'' automata (for a given regular language), in which
minimal automata occur as subautomata. A heuristic for this search is
introduced, which has been implemented in the program AMoRE.
University of Kiel, Germany.
Available as PostScript,
BRICS WWW home page