Lyapunov exponents of one-dimensional, binary stochastic cellular automata

In this paper the stability of elementary cellular automata (ECAs) upon introduction of stochasticity, in the form of an update probability for each cell, is assessed. To do this, Lyapunov exponents, which quantify the rate of divergence between two nearby trajectories in phase space, were used. Furthermore, the number of negative Lyapunov exponents was tracked, in order to gain a more profound insight into the interference between the stability and the update probability, and an upper bound on the Lyapunov exponents of stochastic cellular automata (SCAs) was established