Normal Form (Turing Machine)

computation

Definition

Normal Form

A deterministic Turing machine is in normal form if:

1. it only posses a single final state,
2. the working tape is empty at the end of an accepted run, and
3. the last transition is of form $\delta (s,Z_2,Z_0)=f(Z_0,S,R)$.