论文信息 - Computing Small Nondeterministic Finite Automata

Computing Small Nondeterministic Finite Automata

We study the minimization problem for nondeterministic nite automata. 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. We introduce a heuristic for this search, which has been implemented in the program AMoRE.

Andreas Potthoff | Oliver Matz | O. Matz | A. Potthoff

[1] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .

[2] Tao Jiang,et al. Minimal NFA problems are hard (extended abstract) , 1991 .

[3] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[4] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .

[5] Tsunehiko Kameda,et al. On the State Minimization of Nondeterministic Finite Automata , 1970, IEEE Transactions on Computers.

[6] Maurice Nivat,et al. A note about minimal non-deterministic automata , 1992, Bull. EATCS.

[7] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .

[8] Joonki Kim. State minimization of nondeterministic machines. , 1973 .