- GeeksforGeeks

Last Updated : 10 Dec, 2018

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

List-I	List-II
(a)(a + b)*(ba)	(i) 3
(b)(a + b)aabb(a + b)	(ii) 4
(c) (bb + bbb)*	(iii)5
(d) (ab + ba)*	(iv)6

(A) (a) – (i), (b) – (ii), (c) – (iii), (d) – (ii)
(B) (a) – (ii), (b) – (iv), (c) – (i), (d) – (ii)
(C) (a) – (i), (b) – (iii), (c) – (ii), (d) – (ii)
(D) (a) – (ii), (b) – (iv), (c) – (iii), (d) – (i)

Answer: (C)

Explanation: (a) – DFA for (a + b)*(ba):
$\"\"$
(b) – DFA for (a + b)*aabb(a + b)*:
$\"\"$
(c) – DFA for (bb + bbb)*:
$\"\"$
(d) – DFA for (ab + ba)*:
$\"\"$
So, option (C) is correct.

Quiz of this Question