Synthesis of finite state machines with transformation of the object´s codes

Synthesis of finite state machines (FSM) with transformation of the object´s codes is given. The general method of transformation of codes of state in the codes of microoperations´ sets and vice versa is proposed. The circuit structures of Mealy and Moore automata are proposed and the method of their design is discussed. The further optimization is connected with increasing the circuit´s levels. The possible solutions are given. The minimization of hardware in the circuits of control units is implemented on the programmable logic devices (PLD) for increasing the number of levels in the circuit of FSM.