Gate CS-2006 Question Paper With Solutions

Q. 82 Consider the regular language L = (111 + 111111)* . The minimum number of states in any DFA accepting this languages is

(A) 3

(B) 5

(C) 8

(D) 9

Answer: (D)

Explanation: