TOA Waqas 71

1.

STUDENT:
Name
: Waqas Jan
Roll No
: 2K23/LCS/71
Lecturer:
Mam Pireh Soomro
Topic : Transducers (Moore Machines & Mealy Machines)
Course
: Theory Of Automata
Dept
: Computer Science

2.

Part
I
Part
II
Part
III
Part
IV
Part
V
Introduction
Elements
Examples (Pictorial
Diagrams)
Differences
Conclusion

3.

Introduction
1
2
3
4
Definition
Applications
Definition:
Transducers are a type of finite-state machine
(FSM) that produce outputs based on a given input.
They have two types:
1. Moore Machine
2. Mealy Machine
Transducers are widely used in digital circuits,
control systems, and signal processing.
Moore Machine
Features
Mealy Machine
Features
5

4.

Introduction
1
2
3
4
Definition
Applications
Industrial Automation: Sensors for monitoring
pressure, temperature, and displacement in
control systems.
Medical Equipment: Ultrasound, ECG, and EEG
machines for diagnostics.
Communication Systems: Microphones and speakers
for sound conversion; antennas in wireless
communication.
Automotive Industry: Fuel level, oxygen, and
speed sensors for vehicle monitoring and
control.
Consumer Electronics: Touchscreens,
accelerometers, and gyroscopes in smartphones
and gaming.
Environmental Monitoring: Weather sensors and
pollution detection.
Moore Machine
Features
Mealy Machine
Features
5

5.

Introduction
1
2
3
4
Definition
Applications
A Moore Machine is a type of finite-state
machine (FSM) where the output is determined
solely by the current state.
In a Moore machine, the output does not depend
on the input, but only on the state the machine
is in.
Each state is associated with a fixed output,
and the output is updated when the machine
transitions into a new state.
Moore Machine
Features
Mealy Machine
Features
5

6.

Introduction
1
2
3
4
Definition
Applications
1) Output is state-dependent.
Moore Machine
2) Simpler design but might require more states.
Features
3) Output changes after a state transition
Mealy Machine
Features
5

7.

Introduction
1
2
3
4
Definition
Applications
A Mealy Machine is another type of finite-state
machine (FSM) where the output depends on both
the current state and the input.
In a Mealy machine, the output is produced
immediately based on the current state and the
input symbol received, making it more reactive.
Moore Machine
Features
Mealy Machine
Features
5

8.

Introduction
1
2
3
4
Definition
Applications
1) Output is input- and state-dependent.
Moore Machine
2) Faster response since the output is generated
immediately upon receiving input.
Features
3) Often more efficient in terms of the number of
Mealy Machine
states.
Features
5

9.

Elements
1
2
3
4
Elements
1. Finite Set of States (Q):Set of states that the
machine can be in.
2. Input Alphabet (Σ):The set of all possible
inputs.
3. Output Alphabet (Λ):The set of all possible
outputs.
4. Transition Function (δ):Defines how the machine
transitions from one state to another based on
inputs (Moore/Mealy differ here).
5. Output Function (λ):Defines the output based on
the state (Moore) or transition (Mealy).
Moore Machine
Mealy Machine
5

10.

Elements
1
2
3
4
Elements
Moore Machine
Mealy Machine
5

11.

Elements
1
2
3
4
Kajian Teori
Moore Machine
Mealy Machine
5

12.

1 2
Examples (Pictorial Diagrams)
3
4
Moore Machine
1. S₀ with
input 0
transitions
to S₁.
2. S₁ with
input 1
transitions
to S₂.
3. S₂ with
input 0
returns to
S₀.
Mealy Machine
5

13.

1 2
Examples (Pictorial Diagrams)
3
4
Moore Machine
1. S₀ with
input 0
transitions
to S₁ and
outputs A.
2. S₁ with
input 1
transitions
to S₂ and
outputs B.
3. S₂ with
input 0
transitions
back to S₀
and outputs
Mealy Machine
5

14.

Differences
1
2
3
Differences
Feature
Moore Machine
Mealy Machine
Output Based On
State only
State and input
Output Timing
Only after entering a state
Instantaneous with the
transition
Output Location
Inside the states
On the transitions
Complexity
Simpler design, as output depends
only on states
More complex, as output changes
with inputs
Number of States
May require more states
May require fewer states
Design Preference
Preferred when output is statedependent
Preferred when immediate output
is required
4
5

15.

Conclusion
1
2
3
Conclusion
Moore and Mealy machines are both types of
finite-state machines used in designing systems
that process input and generate output.
Mealy machines often respond faster to inputs,
but Moore machines are simpler in design.
Each has its advantages, and the choice between
them depends on whether immediate output or
simplicity is more important for the system
being designed.
4
5