You do not have permission to edit this page, for the following reason:
You can view and copy the source of this page.
Templates used on this page:
Return to Automata Doubts.
If L and L' are both recursively enumerable, then L is recursive. Why?
Given L is RE. So there is a TM, which accepts and halts for all words in L. Now, if L' is RE=> there is a TM, which accepts and halts for all words not in L. So, if a word is given from L or not from L, give it to both those TMs. If its from L, the first TM will halt and we say it belongs to L. If its not from L, the second one will halt and we say it doesn't belong to L. Thus L becomes recursive..
GATECSE