Scribd
Upload
1 views

MooreMealy Machine

Uploaded by

tbamrrobot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1 views

MooreMealy Machine

Uploaded by

tbamrrobot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Moore/Mealy Machine

FINITE AUTOMATA WITH OUTPUT


FINITE AUTOMATA WITH OUTPUT

• Finite automata may have outputs corresponding to each transition.


There are two types of finite state machines that generate output
• Mealy Machine
• Moore machine
Moore Machine
Example 1-Moore Machine
• Count how many times the substring ‘aab’ occurs in the long input
string.
Example 2-Moore Machine
• Design a Moore machine to generate 1's complement of
a given binary number.
Example 3-Moore Machine
• Design a Moore machine for a binary input sequence such that if it has a
substring 101, the machine output A, if the input has substring 110, it outputs
B otherwise it outputs C.
Mealy Machine
Example 1-Mealy Machine
Count how many times the substring ‘aab’ occurs in the long input string.
Moore Machine Mealy Machine
Example 2-Mealy Machine
• Mealy machine for 1's complement of an input bit string.
Example 3-Mealy Machine
• Increment machine- increment by 1 to the given binary number.
Example 4-Mealy Machine
• Design a Mealy Machine that prints “a” whenever the sequence “01”
is encountered in any input binary string.

You might also like