Minimization of power consumption of finite state machines by splitting their internal states

DOI10.1134/S1064230715030090zbMATH Open1323.49026OpenAlexW1018423289MaRDI QIDQ499102FDOQ499102

Authors: T. N. Grzes, Vyacheslav V. Solov'ev 

Publication date: 30 September 2015

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

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

Recommendations

• Sequential algorithm for low-power encoding internal states of finite state machines
• scientific article; zbMATH DE number 1941087
• A method for minimizing Moore finite-state machines by merging two states
• 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

zbMATH Keywords

transition probabilitiesminimizationfinite state machinesheuristic algorithmspower consumption

Mathematics Subject Classification ID

Existence of optimal solutions to problems involving randomness (49J55) Applications of optimal control and differential games (49N90)

Cites Work

• State Reduction in Incompletely Specified Finite-State Machines
• 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
• Some dangers in state reduction of sequential machines

Cited In (3)

• Splitting the internal states in order to reduce the number of arguments in functions of finite automata
• Sequential algorithm for low-power encoding internal states of finite state machines
• Title not available (Why is that?)

This page was built for publication: Minimization of power consumption of finite state machines by splitting their internal states

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