Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
A cellular automaton is a continuous function F defined on a full-shift AZ which commutes with the shift . Often, to study the dynamics of F one only considers implicitly . Howeve...
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í...
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...