Solved

Let W Be Any String of Length N Is {0,1}

Question 12

Multiple Choice

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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q7: Which of the following is true with

Q8: A language L is accepted by a

Q9: Type-1 Grammar is known as_<br>A)CFG<br>B)CSG<br>C)REGULAR<br>D)All

Q10: Let L<sub>1</sub> = {w ? {0,1}? |

Q11: Regular expressions are<br>A)Type 0 language<br>B)Type 1 language<br>C)Type

Q13: Consider the regular language L = (111+111111)*.

Q14: Which of the following is TRUE?<br>A)Every subset

Q15: Consider the following language L = {anbncndn

Q16: If G is a simple connected 3-regular

Q17: A spanning tree for a simple graph