Which of the following statements in true?
A) If a language is context free it can always be accepted by a deterministic push-down automaton
B) The union of two context free languages is context free
C) The intersection of two context free languages is context free
D) The complement of a context free language is context free
Correct Answer:
Verified
Q3: Match all items in Group 1 with
Q4: Which of the following pairs have DIFFERENT
Q5: Let S and T be language over
Q6: Let L denotes the language generated by
Q7: Consider the following two statements:
S1: { 0^2n
Q9: Given an arbitrary non-deterministic finite automaton (NFA)
Q10: Which of the following is true for
Q11: Which of the following are decidable ?
1)
Q12: If L and L' are recursively enumerable,
Q13: Consider the CFG with {S,A,B) as the
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