Q.

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
Answer» D. 9
4.4k
0
Do you find this helpful?
21

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs