Consider the following statements: I. Recursive languages are closed under…
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 statements are true?
- A.
I only
- B.
I and II
- C.
I and III
- D.
II and III
Attempted by 16 students.
Show answer & explanation
Correct answer: B
Statement I is true because recursive languages are closed under complementation. Statement II holds as recursively enumerable languages are closed under union. Statement III is false since RE is not closed under complementation.
A video solution is available for this question — log in and enroll to watch it.