Let L1 be a recursive language, and let L2 be a recursively enumerable but not…

PYQ GATE 2005

Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

L1' --> Complement of L1
L2' --> Complement of L2 

  1. A.

    L1' is recursive and L2' is recursively enumer­able

  2. B.

    L1' is recursive and L2' is not recursively enumerable

  3. C.

    L1' and L2' are recursively enumerable

  4. D.

    L1' is recursively enumerable and L2' is recursive

Attempted by 146 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…