Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems

Boris Feliksovich Melnikov · Fundamenta Informaticae · 2010

We consider in this paper the problem of edge-minimization for nondeterministic finite automata and some connected questions. We shall formulate a new algorithm solving this problem; this algorithm is a simplification of two ones published before. The connected problems include at first algorithms of combining states. We formulate some new sufficient conditions for the possibility of such combining.

Read the paper · More papers on PaperTik