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

DOI10.1134/S1064230711040113MaRDI QIDQ384661zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Minimization of incompletely specified Mealy finite-state machines by merging two internal states
• Minimization of mealy finite-state machines by internal states gluing
• Aggregation-based minimization of finite state automata
• Minimization of finite state automata through partition aggregation
• scientific article; zbMATH DE number 3414211
• scientific article; zbMATH DE number 4119632
• 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
• Twofold state assignment for the Moore finite state machines
• scientific article; zbMATH DE number 1213009

Cites work

• A heuristic algorithm for the minimization of incompletely specified finite state machines
• scientific article; zbMATH DE number 3902554 (Why is no real title available?)
• Local encoding transformations for optimizing OBDD-representations of finite state machines

Cited in

(15)

• Efficient minimization of homogeneous FSMs for fault diagnosis
• Minimizing the finite-state machines by using the values of input variables for coding the internal states
• Joint use of methods of structural decomposition for optimizing the circuit of Moore FSM
• Minimization of mealy finite-state machines by internal states gluing
• Sequential algorithm for low-power encoding internal states of finite state machines
• Complex minimization method for finite state machines implemented on programmable logic devices
• 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
• Merge-and-Shrink Abstraction
• Minimization of incompletely specified Mealy finite-state machines by merging two internal states
• Model reduction of finite-state machines by contraction
• Reducing the use of resources in the FPGA circuit of a Moore FSM
• scientific article; zbMATH DE number 4119632 (Why is no real title available?)
• Minimization of power consumption of finite state machines by splitting their internal states
• Matrix approach to simplification of finite state machines using semi-tensor product of matrices

Describes a project that uses

Uses Software

• STAMINA

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384661)