Theory of Computation
Quick practice
Question 1 of 5
A Turing machine crashes
A
If the TM visits all states by reading some input symbols
B
If the TM reads all input symbols from the initial state
C
If the transition function is not defined while reading the input symbol from the given input
D
None of these
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go