 Cybernetics and Systems Analysis /  Issue (2016, 52 (2))
Babakov R.M.,
Barkalov A.A.
Algebraic interpretation of microprogram finite-state machine with datapath of transitions 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. © 2016, Springer Science+Business Media New York. Keywords: datapath of transitions, isomorphism, microprogram finite-state machine, partial transition function, transition algebra, Algebra, Microprogramming, Signal encoding, Algebraic interpretations, Data paths, isomorphism, Output functions, Partial functions, Representation of functions, Transition functions, Logic circuits
Cite:
Babakov R.M.,
Barkalov A.A.
(2016). Algebraic interpretation of microprogram finite-state machine with datapath of transitions. Cybernetics and Systems Analysis, 52 (2), 22-29. doi: https://doi.org/10.1007/s10559-016-9814-5 http://jnas.nbuv.gov.ua/article/UJRN-0000496943 [In Russian]. |
PDF
