If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be
A)recursive enumerable
B)recursive
C)context free language (cfl)
D)none of them

Question

Quizplus · Accepted Answer

A Turing machine that accepts all words of a language L and either rejects or loops for words not in L defines L as recursively enumerable. This means L can be listed or enumerated by a Turing machine, but not necessarily decided (where every input must lead to acceptance or rejection).

If Turing Machine Accepts All the Words of the Languages