  We consider a notion of planarity for two-way finite automata and
transducers, inspired by Temperley-Lieb monoids of planar diagrams. We show
that this restriction captures star-free languages and first-order
transductions.
