The Gateway to Computer Science Excellence
+22 votes
2.2k 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.
in Theory of Computation by Veteran (105k points)
edited by | 2.2k views
0
plz explain a and b in brief ?
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).

 Image result for automata languages graph like regular context free

 

2 Answers

+28 votes
Best answer

(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.

by Veteran (424k points)
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
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.
0
Please explain option A.
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.
by Loyal (9.6k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,422 answers
195,193 comments
99,818 users