Theory of Computation MCQ: 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

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

Correct Answer: recursive enumerable

Make the most of this question

This page focuses on one Theory of Computation question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation MCQs All Engineering topics Mock test hub