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:
Verified
Q1: Let L={w \in (0 + 1)*|w has
Q2: Consider the languagesL1={0^{i}1^{j}|i != j},L2={0^{i}1^{j}|i = j},L3
Q4: Let L = L1 \cap L2, where
Q5: Consider the language L1,L2,L3 as given below.
L1={0^{p}1^{q}
Q6: Definition of a language L with alphabet
Q7: Which of the following problems are decidable?
1)
Q8: Consider the set of strings on
Q9: Consider the following Finite State Automaton The
Q10: The minimum state automaton equivalent to the
Q11: Which of the following languages is regular?
A){WW^R
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents