Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions

DOI10.1007/s10559-018-0038-8zbMath1401.68143OpenAlexW2804025759WikidataQ129781125 ScholiaQ129781125MaRDI QIDQ1795502

R. M. Babakov, Alexander Barkalov

Publication date: 16 October 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-018-0038-8

zbMATH Keywords

datapath of transitionsarea of efficient applicationmicroprogrammed finite-state machineoptimization of hardware expenses

Mathematics Subject Classification ID

Related Items (1)

A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions

Cites Work

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

This page was built for publication: Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions