This paper presents a combinatorial study to characterise the dynamics of intersecting Boolean automata circuits and more specifically that of
double Boolean automata circuits
. Explicit formulae are given to count the number of periodic configurations and attractors of these networks and a conjecture proposes a comparison between the number of attractors of isolated circuits and that of double circuits. The aim of this study is to give intuition on the way circuits interact and how a circuits intersection modifies the “degrees of freedom” of the overall network.