Discussion Forum
Que.  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 nondeterministic finite automaton that accepts L? 
a.  n1 
b.  n 
c.  n+1 
d.  2n1 
Answer:n+1
