Let L1 be a recursive language, and let L2 be a recursively enumerable but not…
GATE · 2005 · CS
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 - A.
L1' is recursive and L2' is recursively enumerable
- B.
L1' is recursive and L2' is not recursively enumerable
- C.
L1' and L2' are recursively enumerable
- D.
L1' is recursively enumerable and L2' is recursive
Attempted by 99 students.
Sign up free to check your answer
Sign up freeLoading lesson…