588 views
1 votes
1 votes
Does the statement given below is true?

If a language L is recursive enumerable than there does not exits a TM that could accept complement of L but reject L.

1 Answer

0 votes
0 votes

Because RE languages aren’t closed under complementation. Thus if for L’ there doesnot exist turing machine as the language becomes undecidable .The same machine will reject RE language L and then halt. Thus the above mentioned statement is true. 

 

edited by

Related questions