Scribd
Upload
59 views8 pages

Meley Moore Machine

Moore and Mealy machines are two types of finite state machines that generate outputs. [1] Moore machines have outputs that depend only on the present state, not the input. [2] Mealy machines have outputs that depend on both the present state and input. [3] A Mealy machine can be converted to a Moore machine by making the Mealy machine's outputs the Moore machine's states.

Uploaded by

Rajit Kuthiala
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
59 views8 pages

Meley Moore Machine

Moore and Mealy machines are two types of finite state machines that generate outputs. [1] Moore machines have outputs that depend only on the present state, not the input. [2] Mealy machines have outputs that depend on both the present state and input. [3] A Mealy machine can be converted to a Moore machine by making the Mealy machine's outputs the Moore machine's states.

Uploaded by

Rajit Kuthiala
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/ 8

Moore and Mealy Machine

• 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).
Moore Machine example
a
b

a a b
Q0/0 Q1/0 Q2/0 Q3/1

b
a

Input a a a b a

State q0 q1 q2 q2 q3 q1

output 0 0 0 0 1 0
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).
Mealy Machine example
a/0
b/0

a/0 a/0 b/1


Q0 Q1 Q2 Q3

b/0
a/0

b/1

Input a a a b a

State q0 q1 q2 q2 q3

output 0 0 0 1 0
Moore Machine Conversion
a/1
b/0
Mealy Machine

a/0 a/0 b/0


Q0 Q1 Q2 Q3

b/0
a/0

b
Moore Machine b/1

a a b
Q0/0 Q1/1 Q2/0 Q3/1

b
a

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