Recursive languages are
A) A proper superset of CFL
B) Always recognized by PDA
C) Are also called type 0 languages
D) Always recognized by FSA
Correct Answer:
Verified
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
Q29: Which of the following problem is undecidable?
A)Membership
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
Q35: The logic of pumping lemma is a
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