Algorithms for Algebraic Synthesis of a Finite State Machine Based on State Code Selection

Mathematical Methods of Operations Research · Springer Nature · 2026-09-01 · DOI: 10.1007/s10559-026-00910-2

Аннотация

For a finite state machine with a datapath of transitions, two modifications of known algebraic synthesis algorithms are proposed, combining the enumeration of state coding variants with a special algorithm for selecting codes for each state of the state machine. The algorithm for selecting state codes is based on the analysis of a set of codes that are not currently used to encode any state of the state machine, although they are admissible for use. For each state of the state machine, a code is selected from the set of unused codes that allows to minimize the number of transitions not covered by a given set of operations. Studies showed that the combination of the enumeration of state coding variants with the selection of state codes allows to find formal solutions to the algebraic synthesis problem that have a smaller number of uncovered transitions and lead to lower hardware expenses in the logic circuit of a finite state machine with a datapath of transitions. A software implementation of the proposed algorithms was performed, which confirmed their correctness and effectiveness.

Читать у издателя →

Похожие статьи