MEALY FSM

A Finite State Machine is said to be Mealy state machine, if outputs depend on both present inputs & present states.

As shown in figure, there are two parts present in Mealy state machine. Those are combinational logic and memory. Memory is useful to provide some or part of previous outputs presentstates as inputs of combinational logic.

So, based on the present inputs and present states, the Mealy state machine produces outputs. Therefore, the outputs will be valid only at positive ornegative transition of the clock signal.

MOORE FSM

A Finite State Machine is said to be Moore state machine, if outputs depend only on present states.

As shown in figure, there are two parts present in Moore state machine. Those are combinational logic and memory. In this case, the present inputs and present states determine the next states. So, based on next states, Moore state machine produces the outputs. Therefore, the outputs will be valid only after transition of the state.