Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

Consider the following statements
(I) Recursive languages are closed under complementation
(II) Recursively enumerable languages are closed under union
(III) Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?

Choose the correct answer:

A) I only

B) I and II

C) I and III

D) II and III

Detailed Explanation

No Explanation

Discussion (0)

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

Share Your Thoughts

Feedback