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

DOI10.1134/S106423071303009XzbMath1278.93178OpenAlexW1979859567MaRDI QIDQ393671

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)

Related Items (1)

Complex minimization method for finite state machines implemented on programmable logic devices

Uses Software

• STAMINA

Cites Work

• A method for minimizing Moore finite-state machines by merging two states
• On state reduction of 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
• 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
• State Reduction in Incompletely Specified Finite-State Machines
• A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks

This page was built for publication: Minimization of incompletely specified Mealy finite-state machines by merging two internal states