Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree

Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto +1

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…