Q 24,paper 2,J 13. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below :

and transition table as given below :

	a	b
p	-	Q
Q	R	S
r	R	S
s	R	s

The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to

NFA is

(A) 5

(B) 4

(C) 3

(D) 2 

answer c.

Explanation.

we have two groups {p}, another group can reach to final state.{qrs}. Final states cannot  be further sepearted.

 

it realizes all combination of b appending with combinations of a or b.
llike. bb,bab,bbb,baaab,bbbb.---
b[a+b]*.