← Quiz: Turing Machine Traces: all 10 questions
Quiz: Turing Machine Traces · Question 9 of 10
What happens if a Turing machine reaches a (state, symbol) pair with no transition?
What happens if a Turing machine reaches a (state, symbol) pair with no transition?
- A.It stays still and waits
- B.It moves right by default
- C.It halts; in our convention that counts as rejecting
- D.It restarts from q0
Answer & explanation
Correct answer: It halts; in our convention that counts as rejecting
A missing rule means the machine cannot move, so the run ends without reaching the accept state.
Can you get the rest right without peeking?
Take the timed Quiz: Turing Machine Traces quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →