Can you give an example for option A?

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+19 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.

+22 votes

Best answer

0 votes

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.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.2k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.3k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 15

40,855 questions

47,520 answers

145,895 comments

62,278 users