Scribd
Upload
45 views

Automata Assignmentppt

The document discusses Mealy machines and Moore machines. It provides definitions for Mealy machines including the 6-tuple representation (Q, q0, ∑, O, δ, λ') and explains that in Mealy machines, the output depends on both the present state and input. It also summarizes differences between Mealy and Moore machines such as Moore machines having more states and Mealy machines reacting faster to inputs. Finally, it provides 5 examples of Mealy machines with some illustrated with state diagrams.

Uploaded by

angaw
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
45 views

Automata Assignmentppt

The document discusses Mealy machines and Moore machines. It provides definitions for Mealy machines including the 6-tuple representation (Q, q0, ∑, O, δ, λ') and explains that in Mealy machines, the output depends on both the present state and input. It also summarizes differences between Mealy and Moore machines such as Moore machines having more states and Mealy machines reacting faster to inputs. Finally, it provides 5 examples of Mealy machines with some illustrated with state diagrams.

Uploaded by

angaw
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

Debre markos University

Automata Assignment
G_9
G_9
Name…………………………….....ID
1.Angaw Misganaw…………1244
2.
3.
4.
5.
6
Finite Automata
F A without output
FA DFA £FA
FA with output
Moore Machine Mealy Machine
Mealy Machine
A Mealy machine is a machine in which output symbol
depends upon the present input symbol and present state
of the machine. In the Mealy machine, the output is
represented with each input symbol for each state
separated by /. The Mealy machine can be described by 6
tuples (Q, q0, ∑, O, δ, λ') where
6 tuples
1 Q: finite set of states  
2 q0: initial state of machine  
3 ∑: finite set of input alphabet  
4 O: output alphabet  
5 δ: transition function where Q × ∑ → Q  
6 λ': output function where Q × ∑ →O  
Mealy Machine vs Moore Machine
• To differentiate a Mealy Machine from a
Moore Machine. Mealy Machine
• Output depends both upon present state and
present input.
• Generally, it has fewer states than Moore
Machine.
• Output changes at the clock edges.
• Mealy machines react faster to inputs.
Moore Machine
• Output depends only upon the present state.
• Generally, it has more states than Mealy
Machine.
• Input change can cause change in output
change as soon as logic is done.
• In Moore machines, more logic is needed to
decode the outputs since it has more circuit
delays.
Example 1:

• Design a mealy machine that scans sequence


of input of 0 and 1 and generates output 'A' if
the input string terminates in 00, output 'B' if
the string terminates in 11, and output 'C'
otherwise.
• Solution: The mealy machine will be:
Diagram
Example 2:

Next state

Present state input = 0 input = 1

State Output State Output

→a b x1 c x1

b b x2 d x3

c d x3 c x1

d d x3 d x2
The state diagram of the above
Mealy Machine is
Example 3:

Construct a mealy Machine that produces the


1’s complement of any binary input string
Example 4:
Construct a mealy Machine that prints ‘a’ when
ever the sequence 01 is encountered in any
input binary string
Example 5:
Construct a mealy Machine that gives 2’s
complement of any binary input (assume that the last
carry bit is neglected )
2’complement =1’st complement +1
e.x 10100=
1’complement 01011+1=01100
e.x2 11100
1’complement=0011+1
=0100
Diagram

You might also like