Last Updated : 13 Dec, 2018

Match the following regular expression to their respective minimum number of states in DFA:

List-I List-II
P. (a + b)*(ba) (i) 3
Q. (a + b)*aabb(a + b)* (ii) 4
R. (bb + bbb)* (iii)5
S. (ab + ba)* (iv)6

(A) P – (i), Q – (ii), R – (iii), S – (ii)
(B) P – (ii), Q – (iv), R – (i), S – (ii)
(C) P – (i), Q – (iii), R – (ii), S – (ii)
(D) P – (ii), Q – (iv), R – (iii), S – (i)


Answer: (C)

Explanation: (P) – DFA for (a + b)*(ba):
\"\"
\"\"

(Q) – DFA for (a + b)*aabb(a + b)*:
\"\"
\"\"

(R) – DFA for (bb + bbb)*:
\"\"
\"\"

(S) – DFA for (ab + ba)*:
\"\"
\"\"

So, option (C) is correct.


Quiz of this Question


Share your thoughts in the comments