retagged by
2,132 views
–3 votes
–3 votes

retagged by

1 Answer

1 votes
1 votes

Answer : Neither L nor L' is Recursive Enumerable .

A .From theorem 1 if we consider L is a recursive Language then L' will be recursive and moreover Recursive Language's are closed under complementation..
B .As they said in option One of L and L' is Recursive .If we consider L is Recursive then from theorem 1 we can say L' is going to be Recursive and Hence Recursive Enumerable.
C .I think this does not Logically implies because from theorem 1 if we consider L is Recursive then L' will be Recursive and hence Recursive Enumerable .A/c to theorem 2 itself says if a Language and its complement L' are both Recursive Enumerable which is Contradiction of Option C.
D .If we consider L as Recursive Enumerable but not Recursive then if we take complement of L which is Recursive Enumerable we may get a Recursive Enumerable Language or not because they are not closed under Complementation. So this point is also Logically implies.

Please Let me know does this explanation make sense or is there anything wrong.

Related questions

0 votes
0 votes
2 answers
1
Mk Utkarsh asked Nov 26, 2017
2,080 views
If total turing machine is a proper subset of turing machine then why recursive language is not a proper subset of Recursive Enumerable ?
0 votes
0 votes
1 answer
2