Computer Science Fundamentals
Algorithms
Objective
Mar 01, 2013
Consider the following statements
- Recursive languages are closed under complementation
- Recursively enumerable languages are closed under union
- Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?
Detailed Explanation
Option b is right answer.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts