Filling Curves Constructed in Cellular Automata with Aperiodic Tiling
Abstract
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]| Origin | Files produced by the author(s) |
|---|
Loading...
