Minimization of incompletely specified Mealy finite-state machines by merging two internal states
DOI10.1134/S106423071303009XzbMATH Open1278.93178OpenAlexW1979859567MaRDI QIDQ393671FDOQ393671
Authors: A. S. Klimowicz, Vyacheslav V. Solov'ev 
Publication date: 23 January 2014
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s106423071303009x
Recommendations
- A method for minimizing Moore finite-state machines by merging two states
- Minimization of mealy finite-state machines by internal states gluing
- A heuristic algorithm for the minimization of incompletely specified finite state machines
- Minimization of Mealy finite-state machines by using the values of the output variables for state assignment
- On state reduction of incompletely specified finite state machines
heuristic methodMealy finite-state machinesnumber of internal statesStamina computer programstate pairs
Approximation methods and heuristics in mathematical programming (90C59) Application models in control theory (93C95)
Cites Work
- On state reduction of incompletely specified finite state machines
- State Reduction in Incompletely Specified Finite-State Machines
- A heuristic algorithm for the minimization of incompletely specified finite state machines
- Minimization of mealy finite-state machines by internal states gluing
- A method for minimizing Moore finite-state machines by merging two states
- Transformation of a mealy finite-state machine into a Moore finite-state machine by splitting internal states
- Splitting the internal states in order to reduce the number of arguments in functions of finite automata
- Synthesis of random register logic in programmable logic devices
- Solution of the fitting problem in the digital system design on complex programmable logical devices
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
Cited In (14)
- Complex minimization method for finite state machines implemented on programmable logic devices
- Minimizing the finite-state machines by using the values of input variables for coding the internal states
- Minimization of Mealy finite-state machines by using the values of the output variables for state assignment
- A heuristic algorithm for the minimization of incompletely specified finite state machines
- Merge-and-Shrink Abstraction
- Title not available (Why is that?)
- Minimization of mealy finite-state machines by internal states gluing
- Transformation of a mealy finite-state machine into a Moore finite-state machine by splitting internal states
- Title not available (Why is that?)
- On state reduction of incompletely specified finite state machines
- Minimization of Incompletely Specified Sequential Machines
- Effective reductions of Mealy machines
- Title not available (Why is that?)
- A method for minimizing Moore finite-state machines by merging two states
Uses Software
This page was built for publication: Minimization of incompletely specified Mealy finite-state machines by merging two internal states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393671)
