A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

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 non-deterministic finite automaton that accepts L?
a. n-1
b. n
c. n+1
d. 2n-1
Answer:n+1
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:



View All Questions on: Theory of Computation(TOC)