MCQOPTIONS
Saved Bookmarks
| 1. |
The number of states in a minimal deterministic finite automaton corresponding to the languageL = { an | n=4 } is |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |