Transformation of a mealy finite-state machine into a moore finite-state machine by splitting internal states

Authors:
A. S. Klimovich;V. V. Solov'Ev
Affiliations:
Bia ystok University of Technology, Bia ystok, Poland 15-351 and Higher State College of Communications, Minsk, Belorussia 220114;Bia ystok University of Technology, Bia ystok, Poland 15-351 and Higher State College of Communications, Minsk, Belorussia 220114
Venue:
Journal of Computer and Systems Sciences International
Year:
2010

Citing 9
Cited 1

On Finding a Minimal Functional Description of a Finite-State Machine for Test Generation for Adjacent Machines

IEEE Transactions on Computers
Symbolic two-dimensional minimization of strongly unspecified finite state machines

Journal of Systems Architecture: the EUROMICRO Journal
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines

Formal Methods in System Design
Decomposition of Finite State Machines for Area, Delay Minimization

ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
Saving Power by Mapping Finite-State Machines into Embedded Memory Blocks in FPGAs

Proceedings of the conference on Design, automation and test in Europe - Volume 2
Finite State Machine-Based Optimization of Data Parallel Regular Domain Problems Applied in Low-Level Image Processing

IEEE Transactions on Parallel and Distributed Systems
An application of functional decomposition in ROM-based FSM implementation in FPGA devices

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable embedded systems: Synthesis, design and application
Novel state minimization and state assignment in finite state machine design for low-power portable devices

Integration, the VLSI Journal
An FSM Reengineering Approach to Sequential Circuit Synthesis by State Splitting

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Minimization of incompletely specified mealy finite-state machines by merging two internal states

Journal of Computer and Systems Sciences International

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of transformation of a Mealy finite-state machine (FSM) into an equivalent Moore FSM is considered. This problem often arises in the practice of engineering design, when one needs to avoid direct dependence of the output values on variations in the input values. The proposed approach uses the operation of splitting of internal states of an FSM and represents the machine as a list of transitions. Experiment results have shown that transformation of Mealy FSM into Moore FSM increases the number of internal states, on the average, by a factor of 1.96 and increases the number of transitions by a factor of 2.05; the cost of realization of Moore FSM using an industrial software package is approximately twice as great as the corresponding cost for a Mealy machine. The up-to-date tendencies of development of minimization methods and Moore FSM synthesis are described.