1.7k views

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

1. Neither $L$ nor  $\bar{L}$ is recursively enumerable $(r.e.)$.
2. One of $L$ and $\bar{L}$ is r.e. but not recursive; the other is not r.e.
3. Both $L$ and $\bar{L}$ are r.e. but not recursive.
4. Both $L$ and $\bar{L}$ are recursive.
edited | 1.7k views
0
plz explain a and b in brief ?

(C) is not possible. If $L$ is re we have a TM that accepts string in $L$. If $L$' is re, we have a TM that accepts strings in $L$'. So, using both these TMs we can make a new TM M which accepts strings in $L$ and rejects strings in $L$' - that is $M$ decides $L$, making $L$ recursive.

edited by
+4
Can you give an example for option A?
+1
@Shalini If $L$ itself is not RE then $L'$ is also not RE
+3
IF L is recursive then L' is also Recursive
IF L is Recursively enumerable then L' is NOT recursively enumerable .

Correct me if wrong...
0
That seems correct
0
0
The number of turing machines are countable but total number of languages are uncountable. There are many languages for which turing machines do not exist i.e. they are not recursively enumerable.
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.

1
2