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.