Library

2DFT · Regular transduction (two-way)

A word and its mirror: w ↦ wwᴿ

Sweep right printing every letter, then sweep back printing them again. The result is always a palindrome of even length. One-way transducers cannot reverse; a head that can turn round does it with no memory at all.

startfwdbwddone
The machine as drawn — 4 states, 7 transitions.

The author’s examples, run

a → accept · aab → accept · bbaa → accept · aaaaab → accept · abbaaaa → accept · aaaaaabbbbbabbaaabbaaa → accept · bbbbbabbaaabbaaaaaabbaaabbabbbbb