Automata on the plane vs particles and collisions
In this note, colorings of the plane by finite sequential machines are compared to previously introduced notions of ultimately periodic tilings of the plane. Finite automata with no counter characterize exactly biperiodic tilings. Finite automata with one counter characterize exactly particles - periodic colorings that are ultimately periodic in every direction. Finite automata with two counters and aperiodic colorings characterize exactly Collisions - ultimately periodic tilings of the plane. (C) 2009 Elsevier B.V. All rights reserved.
tilings counter automata languages two-dimensional