If L and L' are recursively enumerable, then L is

2008

If L and L' are recursively enumerable, then L is

Answer: D. recursive — If both L and its complement L' are recursively enumerable, then L is recursive. This follows from the fact that a language is recursive if and only if both…

  1. A.

    regular

  2. B.

    context-free

  3. C.

    context-sensitive

  4. D.

    recursive

Attempted by 72 students.

Show answer & explanation

Correct answer: D

If both L and its complement L' are recursively enumerable, then L is recursive. This follows from the fact that a language is recursive if and only if both it and its complement are recursively enumerable.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…