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

DOI10.1007/S10559-016-9814-5MaRDI QIDQ314987zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• Structural classification of methods for synthesis of a microprogram finite-state machine with datapath of transitions
• Algebraic representations for finite-state machines. II: Module formulation
• scientific article; zbMATH DE number 1696883
• Algebraic representations for finite-state machines. I. Monoid-ring formulation
• Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions

Cites work

• scientific article; zbMATH DE number 3976344 (Why is no real title available?)
• scientific article; zbMATH DE number 46653 (Why is no real title available?)
• scientific article; zbMATH DE number 3559404 (Why is no real title available?)
• scientific article; zbMATH DE number 194331 (Why is no real title available?)
• scientific article; zbMATH DE number 914394 (Why is no real title available?)
• scientific article; zbMATH DE number 5066576 (Why is no real title available?)
• scientific article; zbMATH DE number 3224529 (Why is no real title available?)
• scientific article; zbMATH DE number 3353345 (Why is no real title available?)
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(5)

• A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions
• Translation of interactive Datalog programs for microcontrollers to finite state machines
• Structural classification of methods for synthesis of a microprogram finite-state machine with datapath of transitions
• Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions
• Formal Methods for Components and Objects

This page was built for publication: Algebraic interpretation of a microprogram finite-state machine with datapath of transitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314987)