Question

Part 2 of 2 - Theory Question 5 of 5 4.0 Points The language is recursively enumerable language if? A. If there is a TM that accepts every word in L and rejects words in L', loop(T) is empty B. If there is a TM that accepts every word in L and rejects or loops forever on words in L OC. If there is a TM that rejects every word in L and rejects words in L', loop(T) is empty OD. If there is a TM that accepts every word in L E. If there is a word in L that is rejected and L' loop(T) is empty Reset Selection

just pick the correct answer

Answer 1

The correct answer will be

(B) If there is a TM that accepts every word in L and rejects or loops forever on words in L'.

This is the definition of TM.