Control of cellular automata

Abstract

We study the problem of master-slave synchronization and control of totalistic cellular automata (CA) by putting a fraction of sites of the slave equal to those of the master and finding the distance between both as a function of this fraction. We present three control strategies that exploit local information about the CA, mainly, the number of nonzero Boolean derivatives. When no local information is used, we speak of synchronization. We find the critical properties of control and discuss the best control strategy compared with synchronization.

References in corpus (2)

• Perturbing the topology of the Game of Life increases its robustness to asynchrony
• Synchronization universality classes and stability of smooth, coupled map lattices

Cited by in corpus (4)

• Toward a Boundary Regional Control Problem for Boolean Cellular Automata
• Regional Control of Probabilistic Cellular Automata
• Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles
• Shift-Symmetric Configurations in Two-Dimensional Cellular Automata: Irreversibility, Insolvability, and Enumeration