Q. Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states? (Solved)
1. L must be either {an I n is odd} or {an I n is even}
2. L must be {an I n is odd}
3. L must be {an I n is even}
4. L must be {an I n = 0}
- a. L must be either {an I n is odd} or {an I n is even}