2DFT · Regular transduction (two-way)
Classic: reverse the input
Scans right in silence, then prints on the way back — computing w ↦ wᴿ with a finite state set and a two-way head, no stack required.
The author’s examples, run
ab → accept · baabb → accept · bbaaab → accept · baaabab → accept · babaa → accept · a