Received 17.03.2017, Revised 10.06.2017, Accepted 31.07.2017

Algebraic synthesis of a microprogram automaton with an operational transition automaton

Roman Babakov

For a microprogram final-state machine with datapath of transition, the problem of algebraic synthesis, which is a part of the process of structural synthesis of a given class of final-state machine, is formulated. A formal definition of the solution of the problem of algebraic synthesis is given. The concept of the methodology of algebraic synthesis is introduced. A general algorithm for algebraic synthesis based on a full search with constraints is proposed

microprogram final-state machine, datapath of transitions, algebraic synthesis, algorithm
35-41
Babakov , R. (2017). Algebraic synthesis of a microprogram automaton with an operational transition automaton. Information Technologies and Computer Engineering, 14(2), 35-41.

References

References in the process of publication