Algebraic interpretation of a microprogram finite-state machine with datapath of transitions

DOI10.1007/s10559-016-9814-5zbMath1346.68124OpenAlexW2313521659MaRDI QIDQ314987

R. M. Babakov, Alexander Barkalov

Publication date: 19 September 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9814-5

zbMATH Keywords

isomorphismdatapath of transitionsmicroprogram finite-state machinepartial transition functiontransition algebra

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions, Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions, Structural classification of methods for synthesis of a microprogram finite-state machine with datapath of transitions

Cites Work

• THE ABSTRACT THEORY OF AUTOMATA
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item