Filling Curves Constructed in Cellular Automata with Aperiodic Tiling

Gaétan Richard (1, 2)

1 Equipe AMACC - Laboratoire GREYC - UMR6072
2 UNICAEN - Université de Caen Normandie

In many constructions on cellular automata, information is transmitted with signals propagating through a defined background. In this paper, we investigate the possibility of using aperiodic tiling inside zones delimited by signals. More precisely, we study curves delineated by CA-constructible functions and prove that most of them can be filled with the NW-deterministic tile set defined by Kari [1]. The achieved results also hint a new possible way to study deterministic tile sets.

Domains: Computer Science [cs]

Gaétan Richard. Filling Curves Constructed in Cellular Automata with Aperiodic Tiling. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.165-175, ⟨10.1007/978-3-319-58631-1_13⟩. ⟨hal-01656356⟩