RGPV 2009
Q. Construct minimized DFA for the given NFA.
Or
Convert the following NFA into DFA.
Ans.
Transition table for given NFA
State 
Input 

a 
B 

è q0 
q0, q1 
q0 
q1 
q2 
q1 
q2 
q3 
q3 
q3 
– 
q2 
Transition table for DFA from given NFA table
State 
Input 

a 
B 

è [q0] 
[q0, q1] 
[q0] 
[q0, q1] 
[q0, q1, q2] 
[q0, q1] 
[q0, q1, q2] 
[q0, q1, q2, q3] 
[q0, q1, q2] 
[q0, q1, q2, q3] 
[q0, q1, q2, q3] 
[q0, q1, q2, q3] 
[q0, q1, q2] 
[q0, q1, q2] 
[q0, q1, q2] 