-
What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
-
- L must be {an | n is odd}
- L must be {an | n is even}
- L must be {an | ≥ 0}
- Either L must be {an | n is odd}, or L must be {an | n is even}
Correct Option: D
Lets take an example to solve this.
L1 = {n, nnn, nnnnn, ....}
= {nodd}
= {n2n+1; for n = 0, 1, 2, 3, 4, 5, 6,...}
and L2 = {n, nnnn, nnnnnn,...}
= {neven}
= {n2n; for n = 0, 1, 2, 3, 4, 5, 6...}
Therefore, either L must be {an | n is odd}, or L must be {an | n is even}
