1

If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be

Correct Answer: context free language

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.