Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.17K Points
Coach

Q.) Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.

(A) Assertions (a) and (b) are both true.

(B) Neither (a) nor (b) is true.

(D) None of above

Correct answer : Option (C) - Both False

Discusssion

Related MCQs on Theory of Computation

Q. The arranging of data in a logical sequence is called

Q. Software Engineering:

Q. Global Sensor Network is built for

Q. Sensors used in gestures ........

Q. Internet provides for remote login.

Q. Unit testing is done by

Q. What are the types of requirement in Quality Function Deployment(QFD) ?

Q. ______________ is a classical approach to database design?

Q. If the state of the database no longer reﬂects a real state of the world that the database is supposed to capture, then such a state is called

Q. The behavior of a system is modeled using ________