MCQOPTIONS
Saved Bookmarks
| 1. |
What can be said about a regular language L over {a} whose minimal finite state automaton has two states? |
| A. | L must be {an| n is odd} |
| B. | L must be {an| n is even} |
| C. | L must be {an| n is even} |
| D. | Either L must be {an | n is odd}, or L must be {an | n is even} |
| Answer» E. | |