Back to Questions
Computer Science Fundamentals Algorithms Objective
Mar 06, 2013

Which of the following statements is (are) correct ?

Choose the correct answer:
A) Recursive languages are closed under complementation.
B) If a language and its complement are both regular, the language is recursive
C) Set of recursively enumerable language is closed under union
D) All of these
Detailed Explanation

Option d is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts
Feedback