Q.

Consider the regular language L = (111+111111)*. The minimum number of states inany DFA accepting this language is

A. 3
B. 5
C. 8
D. 9
Answer» D. 9

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs