Which of the following problem is undecidable?
A) Membership problem for CFL
B) Membership problem for regular sets
C) Membership problem for CSL
D) Membership problem for type 0 languages
Correct Answer:
Verified
Q24: PCP is:
A)Decidable
B)Undecidable
C)Sometimes Decidable
D)None of the
Q25: If PCP is decidable then MPCP is
A)Decidable
B)Undecidable
C)Can't
Q26: Consider a language L for which there
Q27: Consider the following statements
I. Recursive languages are
Q28: Recursively enumerable languages are not closed under
A)Union
B)homomorphism
C)complementation
D)concatenation
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 =
Q34: If L1 and L2 are context free
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