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

zbMath1126.68462MaRDI QIDQ2457084

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)

Related Items (5)

Synthesis of fast finite state machines on programmable logic integrated circuits by splitting internal states ⋮ 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 ⋮ Sequential algorithm for low-power encoding internal states of finite state machines ⋮ Complex minimization method for finite state machines implemented on programmable logic devices

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