Multidimensional minimization of nondeterministic finite automata (Part II. Basic algorithms)

In the second part of this paper the authors consider the detailed example of construction of binary relation # and the set of grids of the given regular language; this construction is made in the process of canonization of an automaton defining this language. The article considers two algorithms of combining states of nondeterministic automaton. Based on these algorithms, the researchers formulate a brief algorithm of the edge-minimization, and also an algorithm for adding an edge.