Let L₁ be a recursive language, and let L₂ be a recursively enumerable but not a recursive language. Which one of the following is TRUE? A)L₁' is recursive and L₂' is recursively enumerable B)L₁' is recursive and L₂' is not recursively enumerable C)L₁' and L₂' are recursively enumerable D)L₁' is recursively enumerable and L₂' is recursive

Question

Quizplus · Accepted Answer

The complement of a recursive language (L₁') is recursive, but the complement of a recursively enumerable language that is not recursive (L₂') is not recursively enumerable.

Let L1 Be a Recursive Language, and Let L2 Be

Let L₁ Be a Recursive Language, and Let L₂ Be