Interaction graphs of isomorphic automata networks II: universal dynamics

Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard

An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. I…