Solved

Let L1 Be a Recursive Language, and Let L2 Be

Question 23

Multiple Choice

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?


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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions