← GATE CSE 2006

Q34

MCQ2 marks, −0.5

Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is:

(A)

$3$

(B)

$5$

(C)

$8$

(D)

$9$

Sign in to save attempts.

Loading…