Splitting the internal states in order to reduce the number of arguments in functions of finite automata

MaRDI QIDQ2457084zbMATH OpenFDO

Authors Vyacheslav V. Solov'ev

Publication date 30 October 2007

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimizing the finite-state machines by using the values of input variables for coding the internal states
• A method for minimizing Moore finite-state machines by merging two states
• Minimization of power consumption of finite state machines by splitting their internal states
• Minimization of mealy finite-state machines by internal states gluing
• scientific article; zbMATH DE number 8122

Cited in

(6)

• Synthesis of fast finite state machines on programmable logic integrated circuits by splitting internal states
• Sequential algorithm for low-power encoding internal states of finite state machines
• Complex minimization method for finite state machines implemented on programmable logic devices
• How to Split Recursive Automata
• Minimization of incompletely specified Mealy finite-state machines by merging two internal states
• Minimization of power consumption of finite state machines by splitting their internal states

This page was built for publication: Splitting the internal states in order to reduce the number of arguments in functions of finite automata

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