Define Turing machine as enumerators of strings of a language. Encode the Turing machine TM = ({q₀, q₁, q₂} , {a, b}, {a, b, B}, δ, q₂, B, F) with input w = ba and δ is defined as follows:
δ(q₀, b) → (q₁, b, R), δ(q₁, a) → (q₂, a, R), δ(q₂, a) → (q₁, a, R), δ(q₂, b) → (q₂, b, L)