Scribd
Upload
399 views10 pages

Mealy State Machine: Theory of Computation Finite State Transducer State Diagram

The document discusses Mealy and Moore state machines. A Mealy machine generates an output based on its current state and input, while a Moore machine's output depends only on its current state. Mealy machines often require fewer states than equivalent Moore machines. An example problem is given to derive the state table for a Moore FSM that detects 110 or 101 input patterns and outputs a 1. The detailed solution shows a 6-state Moore state diagram and table. An alternative 4-state Mealy solution is also provided.

Uploaded by

Rajdeep Mandal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
399 views10 pages

Mealy State Machine: Theory of Computation Finite State Transducer State Diagram

The document discusses Mealy and Moore state machines. A Mealy machine generates an output based on its current state and input, while a Moore machine's output depends only on its current state. Mealy machines often require fewer states than equivalent Moore machines. An example problem is given to derive the state table for a Moore FSM that detects 110 or 101 input patterns and outputs a 1. The detailed solution shows a 6-state Moore state diagram and table. An alternative 4-state Mealy solution is also provided.

Uploaded by

Rajdeep Mandal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Mealy state machine

In the theory of computation, a Mealy machine is a finite state transducer that generates an output based on its current state and input. This means that the state diagram will include both an input and output signal for each transition edge. In contrast, the output of a Moore finite state machine depends only on the machine's current state; transitions are not directly dependent upon input. The use of a Mealy FSM leads often to a reduction of the number of states. However, for each Mealy machine there is an equivalent Moore machine.

Mealy state machine

Moore state machine


In the theory of computation, a Moore machine is a finite state transducer where the outputs are determined by the current state alone (and do not depend directly on the input). The state diagram for a Moore machine will include an output signal for each state. Compare with a Mealy machine, which maps transitions in the machine to outputs.

The advantage of the Moore model is a simplification of the behavior.

Moore state machine

Example
Q3.Derive a minimal state table for a single-input and single-output Moore-type FSM that produces an output of 1 if in the input sequence it detects either 110 or 101 patterns. Overlapping sequences should be detected. (Show the detailed steps of your solution.)

State Diagram
Reset w=0 w=0

w=1
A/z=0 B/z=0

w=0
E/z=0

w=1
F/z=1

w=1

w=1

w=1

w=0

C/z=0

w=0

w=1

State Diagram
D/z=1

Sate Table (Moore FSM)


Present state Next State w=0 A A w=1 B 0 Output Z

6 states need 3 flip-flops

State state state state state

Assignment (Mealy FSM): A: Got no 1 B: Got1 C: Got11 D: Got10

Reset 1/0

1/0

1/0

0/0

A
1/1 0/0

B
0/0

0/1

State Diagram

Sate Table (Mealy FSM)


Present state A Next State w=0 A w=1 B Output Z w=0 0 w=1 0

4 states need 2 flip-flops

You might also like