Example

Suppose we have TM defined by

a.    (1, 1, R, 1)

b.    (1, B, L, 2)

c.    (2, 1, B, 2)

Construct D for this machine table:

a.    Q₁tx Ù S₁tx ® Q₁t'x' Ù (S₀ty ® S₀t'y) Ù (S₁ty ® S₁t'y)

b.    Q₁tx' Ù S₀tx' ® Q₂t'x Ù (S₀ty ® S₀t'y) Ù (S₁ty ® S₁t'y)

c.    Q₂tx Ù S₁tx ® Q₂t'x Ù S₀t'x Ù (y¹x ® ((S₀ty ® S₀t'y) Ù (S₁ty ® S₁t'y)))

Depending on n include a sentence describing time 0:

n = 0:    Q₁ee Ù "yS₀ey

n = 1:    Q₁ee Ù S₁ee Ù "y(y¹e ® S₀ey)

n = 2:    Q₁ee Ù S₁ee Ù S₁ee' Ù "y(y¹e Ù y¹e' ® S₀ey)

...

[Succ], [Diff] are always the same.

For H:

The missing instruction is

(2, B, ...)

H = $tx(Q₂xt Ù S₀tx)

Note: in case n = 0 TM halts at t = 1 (e') because it is in q₂ scanning B.