Minimalizations of NFA using the universal automaton

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Science. Official publication website can be found on muni.cz.

Authors	POLÁK Libor
Year of publication	2005
Type	Article in Periodical
Magazine / Source	Int. Journal of Found. of Computer Science
MU Faculty or unit	Faculty of Science
Citation
Field	General mathematics
Keywords	minimalization of NFA; universal automaton
Description	As is well known, each minimal NFA for a regular language L is isomorphic to a subautomaton of the so-called universal automaton U for L. We explore and compare various conditions on sets of states of U which are related to the fact that induced subautomata of U accept the whole language L. The methods of several previous works on minimalizations of NFA can be modified so that they fit in our approach. We also propose a new algorithm which is easy to implement.
Related projects:	Mathematical structures and their physical applications