Scribd
Upload
507 views6 pages

FA With Output - Moore Machine

The document discusses two types of finite state machines that generate output: Mealy machines and Moore machines. Mealy machines output depends on the present state and input, while Moore machines' output depends only on the present state. The document provides examples of state tables and diagrams for each type of machine. It also compares the key differences between Mealy and Moore machines.

Uploaded by

Pranjal Rastogi
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
507 views6 pages

FA With Output - Moore Machine

The document discusses two types of finite state machines that generate output: Mealy machines and Moore machines. Mealy machines output depends on the present state and input, while Moore machines' output depends only on the present state. The document provides examples of state tables and diagrams for each type of machine. It also compares the key differences between Mealy and Moore machines.

Uploaded by

Pranjal Rastogi
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/ 6

FA with output

Finite automata may have outputs corresponding to each transition. There


are two types of finite state machines that generate output −

 Mealy Machine

 Moore machine

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).

The state table of a Mealy Machine is shown below −

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 −

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).

The state table of a Moore Machine is shown below −

Next State
Present state Output
Input = 0 Input = 1
→a b c x2

b b d x1

c c d x2

d d d x3

The state diagram of the above Moore Machine is −

Mealy Machine vs. Moore Machine


The following table highlights the points that differentiate a Mealy Machine
from a Moore Machine.

Mealy Machine Moore Machine

Output depends both upon the present Output depends only upon the present
state and the present input state.

Generally, it has fewer states than Generally, it has more states than Mealy
Moore Machine. Machine.

The value of the output function is a The value of the output function is a
function of the transitions and the function of the current state and the
changes, when the input logic on the changes at the clock edges, whenever
present state is done. state changes occur.

Mealy machines react faster to inputs. In Moore machines, more logic is


They generally react in the same clock required to decode the outputs resulting
cycle. in more circuit delays. They generally
react one clock cycle later.

Moore Machine to Mealy Machine


Algorithm 4
Input − Moore Machine

Output − 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 Q i appears in the
next state.

Example
Let us consider the following Moore machine −

Next State
Present State Output
a=0 a=1

→a d b 1

b a d 0

c c c 0
d b a 1

Now we apply Algorithm 4 to convert it to Mealy Machine.

Step 1 & 2 −

Next State

Present State a=0 a=1

State Output State Output

→a d b

b a d

c c c

d b a

Step 3 −

Next State

Present State a=0 a=1

State Output State Output

=> a d 1 b 0

b a 1 d 1

c c 0 c 0
d b 0 a 1

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