M

Mr. Dubey • 52.61K Points
Coach

Q. Which statement is true?

(A) The tape of turing machine is infinite.
(B) The tape of turing machine is finite.
(C) The tape of turing machine is infinite when the language is regular
(D) The tape of turing machine is finite when the language is nonregular.
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.


Question analytics