Minimization of incompletely specified Mealy finite-state machines by merging two internal states

DOI10.1134/S106423071303009XMaRDI QIDQ393671zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristic methodMealy finite-state machinesnumber of internal statesStamina computer programstate pairs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Application models in control theory (93C95)

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

Cites work

• A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
• A heuristic algorithm for the minimization of incompletely specified finite state machines
• A method for minimizing Moore finite-state machines by merging two states
• Minimization of mealy finite-state machines by internal states gluing
• On state reduction of incompletely specified finite state machines
• Solution of the fitting problem in the digital system design on complex programmable logical devices
• Splitting the internal states in order to reduce the number of arguments in functions of finite automata
• State Reduction in Incompletely Specified Finite-State Machines
• Synthesis of random register logic in programmable logic devices
• Transformation of a mealy finite-state machine into a Moore finite-state machine by splitting internal states

Cited in

(15)

• Matrix approach to simplification of finite state machines using semi-tensor product of matrices
• 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
• scientific article; zbMATH DE number 978906 (Why is no real title available?)
• 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
• On state reduction of incompletely specified finite state machines
• scientific article; zbMATH DE number 2170622 (Why is no real title available?)
• Minimization of Incompletely Specified Sequential Machines
• Effective reductions of Mealy machines
• scientific article; zbMATH DE number 3414211 (Why is no real title available?)
• A method for minimizing Moore finite-state machines by merging two states

Describes a project that uses

Uses Software

• STAMINA

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)