On algorithms for programmed automaton realization

The process of designing a programmed automaton realization is investigated; a method for a priori estimation of the time for computing the logical functions, automaton transition functions and the plant waiting time before the automaton responds to change in the input signal is developed. Versions of programmed realization algorithms are investigated for combinational automata and automate having a memory unit. Certain ways to streamline programmed realization algorithms are proposed.