If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?
A) L1 L2
B) L1 ? L2
C) L1 ? R
D) L1 ? L2
Correct Answer:
Verified
Q29: Which of the following problem is undecidable?
A)Membership
Q30: Recursive languages are
A)A proper superset of CFL
B)Always
Q31: Consider the following problem x. Given a
Q32: If a language is denoted by a
Q33: Given A = {0,1} and L =
Q35: The logic of pumping lemma is a
Q36: For two regular languages L1 = (a
Q37: Pumping lemma is generally used for proving
Q38: What is the highest type number which
Q39: Following syntax-directed translation scheme is used with
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