Solved

Consider the Regular Language L =(111+11111)

Question 24

Multiple Choice

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

Related Questions

Q15: Which of the following assertions about Turing

Q16: The regular expression have all strings in

Q17: For s ? (0+1)* let d(s) denote

Q18: Suppose that a problem A is known

Q19: If an effectively solvable problem has answered

Q20: Languages are proved to be regular or

Q21: The languages -------------- are the examples of

Q22: _ states are called the halt states.<br>A)ACCEPT

Q23: Let L<sub>1</sub> be a recursive language, and

Q25: The PDA is called non-deterministic PDA when