A method of synthesis of finite state automations of E class (method À5)
Key feature of methods À5 and À6 synthesis of finite state automations
of E classes and F is usage of triggers of entry buffers PLD as units
of memory of the finite state automation when dialingins coincide with
a part of the code of inwardnesses. It considerably allows to lower
cost of implementation and simultaneously to increase speed of finite
state automations, in comparison with automata of classes A and B.
In methods À5 and À6 decomposition of inwardnesses is used for coercion
of the initial finite state automations of classes A and B accordingly
to automata of E classes and F. Coding of inwardnesses of automata of E
classes and F is reduced to the task of a coating of the graph of
orthogonality of strings(lines) of a ternary matrix by minimum number
of complete subgraphs. Generally for possibility of construction of
finite state automations of E classes and F each entry buffer the PLD
should have two links with internal logic PLD: register and
combinatorial.
To disadvantages of methods À5 and À6 it is necessary to refer
necessity of decomposition of inwardnesses for coercion of the initial
finite state automations of classes A and B to automata of E classes
and F. Besides at synthesis of an automaton of F class decomposition of
inwardnesses for coercion of an automaton such as Mile to an automaton
such as Moore also is used.