Solved

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

Question 24

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

Q15: Definition of a language L with alphabet

Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>

Q17: Consider the regular language L =(111+11111)*. The

Q18: Consider the languages: GATE[2005]L<sub>1</sub> = {wwR w

Q19: Which of the following problems are decidable?<br>1)

Q20: Which of the following languages is regular?<br>A){WW^R

Q21: Let L = L<sub>1</sub> \cap L<sub>2</sub>, where

Q22: Consider the following Finite State Automaton The

Q23: Let L={w \in (0 + 1)*|w has

Q25: The language L = { 0^i 2