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?

Answer: B. I and II — Statement I is true because recursive languages are closed under complementation. Statement II holds as recursively enumerable languages are closed under…

  1. A.

    I only

  2. B.

    I and II

  3. C.

    I and III

  4. D.

    II and III

Attempted by 52 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.

Explore the full course: Mppsc Assistant Professor Computer Science Paper 2

Loading lesson…