Minimizing the finite-state machines by using the values of input variables for coding the internal states
DOI10.1134/S1064230718050106zbMATH Open1411.93113OpenAlexW2896871832WikidataQ129090361 ScholiaQ129090361MaRDI QIDQ1735294FDOQ1735294
Authors: M. Ostapchuk, Vyacheslav V. Solov'ev 
Publication date: 28 March 2019
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064230718050106
Recommendations
- Complex minimization method for finite state machines implemented on programmable logic devices
- Minimization of Mealy finite-state machines by using the values of the output variables for state assignment
- A method for minimizing Moore finite-state machines by merging two states
- Minimization of mealy finite-state machines by internal states gluing
- Minimization of incompletely specified Mealy finite-state machines by merging two internal states
Cellular automata (computational aspects) (68Q80) Synthesis problems (93B50) Software, source code, etc. for problems pertaining to systems and control theory (93-04) Digital control/observation systems (93C62)
Cites Work
Cited In (11)
- Structural classification of methods for synthesis of a microprogram finite-state machine with datapath of transitions
- Synthesis of finite state machines for CPLDs
- Complex minimization method for finite state machines implemented on programmable logic devices
- Minimization of Mealy finite-state machines by using the values of the output variables for state assignment
- A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions
- Minimization of mealy finite-state machines by internal states gluing
- Splitting the internal states in order to reduce the number of arguments in functions of finite automata
- Determining the area of efficient application of a microprogrammed finite-state machine with datapath of transitions
- Minimization of power consumption of finite state machines by splitting their internal states
- Structural models of finite-state machines for their implementation on programmable logic devices and systems on chip
- A method for minimizing Moore finite-state machines by merging two states
This page was built for publication: Minimizing the finite-state machines by using the values of input variables for coding the internal states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735294)
