Multiple Choice
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
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q8: A language L is accepted by a
Q9: Type-1 Grammar is known as_<br>A)CFG<br>B)CSG<br>C)REGULAR<br>D)All
Q10: Let L<sub>1</sub> = {w ? {0,1}? |
Q11: Regular expressions are<br>A)Type 0 language<br>B)Type 1 language<br>C)Type
Q12: Let w be any string of length
Q14: Which of the following is TRUE?<br>A)Every subset
Q15: Consider the following language L = {anbncndn
Q16: If G is a simple connected 3-regular
Q17: A spanning tree for a simple graph
Q18: If G is a simple connected 3-regular