RGPV 2010
Q. Formally define the following (with example)
M = (Q, Σ, △, δ, λ, q0)
 Q is finite set of states.
 Σ is the input alphabet.
 △ is the output alphabet.
 δ is transition function which maps Q×∑ → Q.
 ‘λ’ is the output function which maps Q×∑→ △.
 q0 is the initial state.
Transition table for Mealy machine
Present state 
Next state 

a = 0 
a = 1 

State 
Output 
State 
Output 

>q1 
q1 
0 
q2 
0 
q2 
q1 
0 
q2 
1 
Transition diagram for Mealy machine 
M = (Q, Σ, △, δ, λ, q0)
 Q is finite set of states.
 Σ is the input alphabet.
 △ is the output alphabet.
 δ is transition function which maps Q×∑ → Q.
 ‘λ’ is the output function which maps Q → △.
 q0 is the initial state.
Transition table for Moore machine
Present state 
Next state 
Output 

a = 0 
a = 1 

>q1 
q1 
q2 
0 
q2 
q1 
q3 
0 
q3 
q1 
q3 
1 
Transition diagram for Moore machine 