What can be said about a regular language L over {a} whose minimal finite…
GATE · 2000 · CS · Question 2 subpartsModified — slightly modified from the official paper; see the solution
What can be said about a regular language L over {a} whose minimal finite state automaton has exactly two states forming a 2-cycle on the input a?
- A.
L must be {an| n is odd}
- B.
L must be {an| n is even}
- C.
L must be {aⁿ | n ≥ 0}
- D.
Either L must be {an | n is odd}, or L must be {an | n is even}
Attempted by 262 students.
Sign up free to check your answer
Sign up freeLoading lesson…