27 votes

Let $L$ be a language and $\bar{L}$ be its complement. Which one of the following is **NOT **a viable possibility?

- Neither $L$ nor $\bar{L}$ is recursively enumerable $(r.e.)$.
- One of $L$ and $\bar{L}$ is r.e. but not recursive; the other is not r.e.
- Both $L$ and $\bar{L}$ are r.e. but not recursive.
- Both $L$ and $\bar{L}$ are recursive.

0

@Shubham Option A: In figure if your language L lies in outer space(not R E) then its compliment will also lie in outer space(not RE HERE it can idientified using ALAN) so This statement is true.

Option B:: if langugae L is Re but not rec(meaning it is not recursive so **Total turing machine** not possible but RE so **Univarsal turing machine** possible) . L compliment will not be RE (as only recursive lang is closed under compliment).

31 votes

Best answer

4

IF L is recursive then L' is also Recursive

IF L is Recursively enumerable then L' is NOT recursively enumerable .

Correct me if wrong...

IF L is Recursively enumerable then L' is NOT recursively enumerable .

Correct me if wrong...

1 vote

A) It is possible if L itself is NOT RE. Then L' will also not be RE. B) Suppose there is a language such that turing machine halts on the input. The given language is RE but not recursive and its complement is NOT RE. C) This is not possible because if we can write enumeration procedure for both languages and it's complement, then the language becomes recursive. D) It is possible because L is closed under complement if it is recursive. Thus, C is the correct choice.