Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...
This paper presents an application of Cellular Automata in the field of dry Granular Systems modelling. While the study of granular systems is not a recent field, no efficient mo...
In this paper we report on the synthesis of sounds using cellular automata, specifically the multitype voter model. The mapping process adopted is based on digital signal processin...
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...