The Family of recursive language is not closed under which of the following operations:
A) Union
B) Intersection
C) Complementation
D) None of the above.
Correct Answer:
Verified
Q18: Let S and T be language over
Q19: Which of the following pairs have DIFFERENT
Q20: Match all items in Group 1 with
Q21: A minimum state deterministic finite automation accepting
Q22: Any Language generated by an unrestricted grammar
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
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