Equivalent conversions of control automata generated from description of plant behaviour

A class of automata is indicated which are generated by description of the input-output sequence in the primary language. These automata are shown to be non-equivalent in common automata terms. A relation of partial order is introduced for them which is specified as a relation of intersection of associated input and output alphabets. The automata ordered in this principle make a structure. The automata of one level there in depend on the same number of variables and have comparable memory. For structure elements relations in the form of automata compositional and decompositional equations are proved.