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.
Algorithms for Algebraic Synthesis of a Finite State Machine Based on State Code Selection. // Mathematical Methods of Operations Research. – 2026. – DOI: 10.1007/s10559-026-00910-2. – URL: https://link.springer.com/article/10.1007/s10559-026-00910-2
(2026). Algorithms for Algebraic Synthesis of a Finite State Machine Based on State Code Selection. Mathematical Methods of Operations Research. https://doi.org/10.1007/s10559-026-00910-2
“Algorithms for Algebraic Synthesis of a Finite State Machine Based on State Code Selection.” Mathematical Methods of Operations Research, 2026. doi:10.1007/s10559-026-00910-2.
@article{article34339,
title = {Algorithms for Algebraic Synthesis of a Finite State Machine Based on State Code Selection},
journal = {Mathematical Methods of Operations Research},
year = {2026},
doi = {10.1007/s10559-026-00910-2},
url = {https://link.springer.com/article/10.1007/s10559-026-00910-2}
}
We consider the problem of non-local models of collective cell migration on growing domains. Gerisch (BMB 2026) developed the first viable computational framework for one-dimensional domains, with a focus on spatially homogeneous...
Complete deconvolution is a class of unsupervised methods that aim to estimate both cell-type proportions and cell-type–specific gene expression profiles (GEPs) from bulk RNA-seq data, without requiring prior reference profiles. Hence,...
In a series of recent papers the authors have faced the problem of eventual eradication and possible control of an outbreak of the Olive Quick Decline Syndrome (OQDS), motivated by the occurrence of such event in Southern Italy since...
Phenotypic plasticity in breast cancer involves stochastic transitions among gene-expression states, but the dynamical determinants of their probability and timing cannot, in general, be reduced to a unique potential landscape in...
Examining the impact of oral contraceptive (OC) dosing is important to understand how hormonal contraceptives influence ovulation, the menstrual cycle, and critically, the contraceptive state. In this paper, we develop a mechanistic...