Let w be any string of length \(n\) in \(\{0, 1\}^*\). Let \(L\) be the set of…
PYQ GATE 2010
Let w be any string of length in . Let be the set of all substrings of . What is the minimum number of states in a non-deterministic finite automaton that accepts ?
- A.
- B.
- C.
- D.
Attempted by 457 students.
Sign up free to check your answer
Sign up freeLoading lesson…

