Consider the languagesL1={0^{i}1^{j}|i != j},L2={0^{i}1^{j}|i = j},L3 = {0^{i}1^{j}|i = 2j+1},L4 = {0^{i}1^{j}|i != 2j}.Which one of the following statements is true?
A) Only L2 is context free
B) Only L2 and L3 are context free
C) Only L1 and L2 are context free
D) All are context free
Correct Answer:
Verified
Q1: Let L={w \in (0 + 1)*|w has
Q3: Let w be any string of length
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