1,784 views

2 Answers

Best answer
3 votes
3 votes

L is decidable means it is Recursive language and Recursive language are closed under Complement.So Both L and L' are REC

And Recursive language are Turing recognizable .

So both L and L' are Turing recognizable Option A

0 votes
0 votes
Option A is right option bcz we know that if L is closed under complementation that's why option A will be right option for it.

Related questions

2 votes
2 votes
1 answer
1
Anurag_s asked Aug 15, 2015
1,963 views
Answer True/False for the statements:S1: $L ≤_m \{0^n1^n \mid n ≥ 0\}$ then $L$ is decidable.S2: if $L$ is R.E. and $L’ ⊆ L$ then $L’$ is recursively enumerable...
1 votes
1 votes
1 answer
3
Xylene asked Jul 15, 2017
1,069 views
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?