论文信息 - Minimalizations of NFA Using the Universal Automaton

Minimalizations of NFA Using the Universal Automaton

In this contribution we shall see how our (algebraic) approach to the so-called universal automaton of a given regular language helps to understand the process of the minimalization of a NFA. The minimality is meant with respect to the number of states. Although it is known that the problem is PSPACE-complete (see [5]) one can propose algorithms of not too high complexities to compute relatively good approximations.

Libor Polák

[1] J. Conway. Regular algebra and finite machines , 1971 .

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

[3] Libor Polák. Syntactic Semiring and Universal Automaton , 2003, Developments in Language Theory.

[4] Tao Jiang,et al. A Note on the Space Complexity of Some Decision Problems for Finite Automata , 1991, Inf. Process. Lett..

[5] Esko Ukkonen,et al. Bideterministic automata and minimal representations of regular languages , 2004, Theor. Comput. Sci..

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

[7] Aurélien Lemay,et al. Residual Finite State Automata , 2002, Fundam. Informaticae.