in Theory of Computation
4,471 views
4 votes
4 votes

 Consider the following statements:

  1. Recursive languages are closed under complementation
  2. Recursively enumerable languages are closed under union
  3. Recursively enumerable languages are closed under complementation

Which of the above statements are true?

  1. I only
  2. I and II
  3. I and III
  4. II and III
in Theory of Computation
4.5k views

1 Answer

4 votes
4 votes
Best answer
  1. Recursive languages are closed under complementation - True.
  2. Recursively enumerable languages are closed under union - True.
  3. Recursively enumerable languages are closed under complementation- False

 

Ans- B.

 

selected by
Answer: