On the transition reduction problem for finite automata

Abstract

We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language $L(E_n)$ denoted by the regular expression $E_n=(1+\epsilon )...(2+\epsilon )...(3+\epsilon )...(n+\epsilon )$. These results can be used in the general case of the transition reduction problem.

22 pages, 7 figures, submitted; Keywords: language, automata, reduction, deterministic minimal automaton, state, regular expression, $Z$-partition, $P$-trees