Finite automaton state assignment with unitary codes

A regular method of coding the internal states of finite automata is considered; under this method the minimum disjunctive normal forms of acting functions and outputs are obtained in the form of a disjunction of implicants containing not more than two letters. The obtaining of the function minimum forms is simple and is not limited by the complexity of the automaton synthesized. The results are optimal with regard to the stability and the quick – response of the automaton. Certain conditions determining the economy of the арраratus realization are given.