A new principle is proposed for the realization of transition functions in a microprogram automaton. The principle is based on the representation of the code of an automaton state in the form of an arithmetic value transformed by arithmetic-logical operations. A structure of a microprogram automaton with operational formation of transitions is proposed.

No abstract

A new principle is proposed for the representation of functions of a microprogram finite state machine with datapath of transitions in the form of a set of some algebras. The principle consists of partitioning the set of tuples forming transition and output functions into subsets each of which is interpreted as a partial function from the signature of the corresponding algebra.

No abstract

No abstract