A single tape Turing Machine M has six states {q₀, q₁, q₂, q₃, q₄, q₅}, of q₀ and q₅ are initial state and final state respectively. The tape alphabet of M is {a, b, B} and its input alphabet is {a, b}. The symbol B is the blank symbol used to indicate end of an input string. The transition function of M is given below:

                  δ(q₀, a) = (q₁, a, R),

                  δ(q₁, a) = (q₂, a, R),

                  δ(q₂, a) = (q₃, a, R),

                  δ(q₃, a) = (q₃, a, R),

                  δ(q₃, b) = (q₄, b, R),

                  δ(q₃, B) = (q₅, B, L),

                  δ(q₄, b) = (q₄, b, R),

                  δ(q₄, B) = (q₅, B, L),

The transition δ(q₀, a) = (q₁, a, R) signifies that if M is in state q₀ and reads a on the current page square, then it writes a on the same tape square, moves its tape head one position to the right and transition to state q₁.