Размер шрифта: 

This paper introduces a special binary relation on the set of regular languages, which possesses all three properties of equivalence relation. That is, this relation separates the whole class of regular lan- guages into non-intersecting classes. In addition, it allows us to consider only one representative of each class in the description of the regular languages class, the so-called \simplied" language. Such simplied lan- guage corresponds to a \simplied" automaton. This equivalence relation makes it possible to limit the number of considered regular languages to a nite number of nite automata with a priori xed number of states. In addition, this equivalence relation preserves the relation # considered in our previous papers, and therefore allows us to use the previous theory. For example, on the basis of obtained results, we can apply various algo- rithms of equivalent transformations of nondeterministic nite automata to simplied them.