Theory of Computation
Moore to Mealy Machine
Faculty Name: Aravendra Sharma
Outlines
• Prerequisite of topic
• Problem Objective
• Moore Machine
• Mealy Machine
• Conversion of Moore to Mealy machine
• Assignment
• Learning Outcomes
• References
Prerequisite of topic
Students should have knowledge about the construction of mealy machine
and moore machine as well as the difference between them.
Problem Objective
The objective of this lecture is to give the knowledge about the
conversion of Moore to Mealy machine.
Moore Machine (Deterministic)
• Moore machines are finite state machines with output value and its
output depends only on present state. Moore machine can be
described by 6 tuples (Q, ∑ , δ, q0, ∆, λ) where,
Q: finite set of states
∑: finite set of input symbols
δ: transition function where Q × ∑ → Q
q0: initial state
∆ : output alphabet , also represented by O
λ: output function where Q → ∆
Mealy Machine (Deterministic)
• Mealy machines are finite state machines with output value and its
output depends on present state and present input. Mealy machine
can be described by 6 tuples (Q, ∑ , δ, q0, ∆, λ) where,
Q: finite set of states
∑: finite set of input symbols
δ: transition function where Q × ∑ → Q
q0: initial state
∆ : output alphabet , also represented by O
λ: output function where Q × ∑ → ∆
Conversion of Moore to Mealy Machine
Convert the given Moore machine into its equivalent Mealy
machine.
M= ({ q0, q1, a2}, {0, 1}, δ, {a,b}, q0,
λ)
Conversion of Moore to Mealy Machine
Convert the given Moore machine into its equivalent Mealy
machine.
The transition table of given Moore machine is as follows:
State Q a b Output
q0 q1 q0 0
q1 q1 q2 0
q2 q1 q0 1
Conversion of Moore to Mealy Machine
Hence the transition table for the Mealy machine can be drawn as
follows:
Conversion of Moore to Mealy Machine
Hence the transition table for the Mealy machine can be drawn as
follows:
Conversion of Moore to Mealy Machine
The equivalent Mealy machine will be,
Conversion of Moore to Mealy Machine
Convert the given Moore machine into its equivalent Mealy
machine.
State (Q) a b Output
q0 q0 q1 0
q1 q2 q0 1
q2 q1 q2 2
Conversion of Moore to Mealy Machine
The transaction diagram for the given problem can be drawn
as:
Conversion of Moore to Mealy Machine
The transaction diagram for the given problem can be drawn
as:
Conversion of Moore to Mealy Machine
The transaction diagram for the given problem can be drawn
as:
Conversion of Moore to Mealy Machine
The equivalent Mealy machine will be,
Assignment
Construct a Mealy machine which is equivalent to given Moore
machine.
Learning Outcomes
Students learn the following outcomes:
• Understand the construction of finite automata with output.
• Understand the conversion of moore machine to mealy
machine.
References
1. Hopcroft & Ullman “Introduction to Automata theory, languages
& Computation” , Narosha Publishing house.
2. Lewish Papadimutrau “Theory of Computation” , Prentice Hall of
India, New Delhi.
3. Mishra & Chander Shekhar “Theory of Computer
Science (Automate, Language & Computations), PHI.
4. https://www.javatpoint.com/conversion-from-moore-machine-to-
mealy-machine.
