Scribd
Upload
202 views14 pages

TOC Moore and Mealy Machine

The document discusses Moore and Mealy machines. It states that Moore machines have outputs that depend only on the present state, while Mealy machines have outputs that depend on both the present state and present input. It provides examples of converting between Moore and Mealy machines. Finally, it discusses some applications of finite state machines, including vending machines and traffic lights.

Uploaded by

Sakshi Choudhary
Copyright
© © All Rights Reserved
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
202 views14 pages

TOC Moore and Mealy Machine

The document discusses Moore and Mealy machines. It states that Moore machines have outputs that depend only on the present state, while Mealy machines have outputs that depend on both the present state and present input. It provides examples of converting between Moore and Mealy machines. Finally, it discusses some applications of finite state machines, including vending machines and traffic lights.

Uploaded by

Sakshi Choudhary
Copyright
© © All Rights Reserved
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/ 14

Moore And

Mealy Machine
GROUP NO. 3
INTRODUCTION

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
Moore machine is an FSM whose outputs depend on
only the present state.A Moore machine can be
described by a 6 tuple (Q, ∑, O, δ, X, q0) where −
Q is a finite set of states.
∑ is a finite set of symbols called the input
alphabet.
O is a finite set of symbols called the output
alphabet.
δ is the input transition function where δ: Q × ∑ →
Q
X is the output transition function where X: Q → O
q0 is the initial state from where any input is
∈
processed (q0 Q).
Mealy Machine
A Mealy Machine is an FSM whose output depends on the
present state as well as the present input.

It can be described by a 6 tuple (Q, ∑, O, δ, X, q0) where −


Q is a finite set of states.
∑ is a finite set of symbols called the input alphabet.
O is a finite set of symbols called the output
alphabet.
δ is the input transition function where δ: Q × ∑ → Q
X is the output transition function where X: Q × ∑ → O
q0 is the initial state from where any input is
∈
processed (q0 Q).
What's the difference?
Moore Machine Mealy Machine
Output depends only upon the present Output depends both upon the present
state. state and the present input.
Generally, it has more states than Mealy Generally, it has fewer states than
Machine. Moore Machine.
The value of the output function is a The value of the output function is a
function of the current state and the function of the transitions and the
changes at the clock edges, whenever changes when the input logic on the
state changes occur. present state is done.
In Moore machines, more logic is Mealy machines react faster to inputs.
required to decode the outputs
They generally react in the same clock
resulting in more circuit delays. They
cycle.
generally react one clock cycle later.
Mealy machine to Moore
Machine

Step 1: For each state(Qi), calculate the number of


different outputs that are available in the transition
table of the Mealy machine.
Step 2: Copy state Qi, if all the outputs of Qi are the
same. Break qi into n states as Qin, if it has n distinct
outputs where n = 0, 1, 2...
Step 3: If the output of initial state is 0, insert a new
initial state at the starting which gives 1 output.
Moore Machine to Mealy
Machine
Step 1 − Take a blank Mealy Machine
transition table format.
Step 2 − Copy all the Moore Machine
transition states into this table format.
Step 3 − Check the present states and their
corresponding outputs in the Moore
Machine state table; if for a state Qi output
is m, copy it into the output columns of the
Mealy Machine state table wherever Qi
appears in the next state.

Applications

Modern CPUs, computers, cell phones, digital


clocks and basic electronic devices/machines
have some kind of finite state machine to control
it.
There are many such simple systems, such as
vending machines or basic electronics. Some
examples of applications:

number classification watch with a timer


vending machine traffic light
barcode scanner gas pumps
Vending Machine
Detectors sense the presence of cars waiting on the farm road
with no car on a farm road, light remains green in highway
direction
if a vehicle on a farm road, highway lights go from Green to
Yellow to Red, allowing the farm road lights to become green
these stay green only as long as a farm road car is detected
but never longer than a set interval
when these are met, farm lights transition from Green to
Yellow to Red, allowing the highway to return to green
even if farm road vehicles are waiting, the highway gets at
least a set interval as green
Contd..

A busy highway is
intersected by a little
used farmroad

Assume you have an interval timer


that generates: a short time pulse
(TS) and a long time pulse (TL), in
response to a set (ST) signal. TS is
to be used for timing yellow lights
and TL for green lights
State Diagram...
Contd..

GENERATE STATE TABLE WITH


SYMBOLIC STATES

CONSIDER STATE ASSIGNMENTS


OUTPUT ENCODING – SIMILAR


PROBLEM TO STATE ASSIGNMENT

(GREEN = 00, YELLOW = 01, RED = 10)


Thank you!
Group Members:
Radha Govindwar(50)
Shruti Jawale(60)
Tanmayee Kalpande(62)
Sejal Zade(66)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy