MCQOPTIONS
Saved Bookmarks
| 1. |
Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L? |
| A. | n-1 |
| B. | n |
| C. | n+1 |
| D. | 2n-1 |
| Answer» D. 2n-1 | |