15 views

What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states?

1. $L$ must be $\{a^n \mid n \ \text{ is odd}\}$
2. $L$ must be $\{a^n \mid n \ \text{ is even}\}$
3. $L$ must be $\{a^n \mid n \geq 0\}$
4. Either $L$ must be $\{a^n \mid n \text{ is odd}\}$, or $L$ must be $\{a^n \mid n \text{ is even}\}$