Multiple Choice
Consider the regular language L =(111+11111) *. The minimum number of states
A) 3
B) 5
C) 8
D) 9
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q12: Consider the following statements about the context
Q13: The minimum state automaton equivalent to the
Q14: Let L<sub>1</sub> be a recursive language, and
Q15: Definition of a language L with alphabet
Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>
Q18: Consider the languages: GATE[2005]L<sub>1</sub> = {wwR w
Q19: Which of the following problems are decidable?<br>1)
Q20: Which of the following languages is regular?<br>A){WW^R
Q21: Let L = L<sub>1</sub> \cap L<sub>2</sub>, where
Q22: Consider the following Finite State Automaton The