A method for minimizing Moore finite-state machines by merging two states

DOI10.1134/S1064230711040113zbMath1275.93046OpenAlexW1999710576MaRDI QIDQ384661

A. S. Klimovich, Vyacheslav V. Solov'ev

Publication date: 28 November 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230711040113

zbMATH Keywords

digital devicesminimizing the number of internal states, transition paths, number input variablesMoore finite-state machines (FSMs)

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Application models in control theory (93C95) Variable structure systems (93B12) Digital control/observation systems (93C62)

Related Items (2)

Minimization of incompletely specified Mealy finite-state machines by merging two internal states ⋮ Sequential algorithm for low-power encoding internal states of finite state machines

Uses Software

• STAMINA

Cites Work

• Unnamed Item
• A heuristic algorithm for the minimization of incompletely specified finite state machines
• Local encoding transformations for optimizing OBDD-representations of finite state machines

This page was built for publication: A method for minimizing Moore finite-state machines by merging two states