Automata on the Plane vs Particles and Collisions

Nicolas Ollinger (1) , Gaétan Richard (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

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.

Mots clés: counter automata; languages; two-dimensional; tilings

Domaines: Autre [cs.OH]

Nicolas Ollinger, Gaétan Richard. Automata on the Plane vs Particles and Collisions. 2008. ⟨hal-00310960v2⟩