Exam-style question
Try this first
What is the defining characteristic of a halting state in a Turing machine?.
- A.It is always the start state
- B.It has no outgoing transitions
- C.It can only move the head to the left
- D.It must contain a blank symbol
Model answer
What a good answer should say
- It has no outgoing transitions
Explanation
Why this works
A state with no outgoing transitions is called a halting state. The machine stops when it enters such a state.
Common mistake
No common mistake is linked to this question yet.