Sensitivity to synchronism in some boolean automata networks

We study the sensitivity of some Boolean automata networks to changes in their dynamics against deterministic update perturbations. Due to their large number of different dynamics, they can be extremely sensitive to update schedule perturbations, which renders them not robust in this sense, a feature often undesirable in many applications. Here, we study the maximum number of different dynamics in elementary cellular automata, with fixed, cyclic lattices. First, we formally prove the estimate 3 n + 2 − 2 n+1 for such a number, empirically proposed in a previous work, as well as its sharpness, by proving that some rules actually reach it. Finally, we discuss possible key follow-ups to the present study.