Application of language of equivalent transformations for description of ensembles of finite automata

A possibility of applying the language of equivalent transformations for the description of ensembles of finite automata in the input — output alphabet is considered. There are stated the necessary and sufficient conditions under which the ensemble described in the language of equivalent transformations may be realized by the initial or non-initial automaton. The corresponding algorithms of the analysis and the synthesis are presented.