Equivalence relations on finite dynamical systems (Q5933471)

The paper is concerned with the study of Boolean functions \(f:k^n \to k^n\) where \(k^n=k\times k\times \cdots\times k\) and \(k=\{0,1\}\). Together with their iterates such functions are viewed as finite dynamical systems on the set of binary strings. It is shown how to define such a dynamical system and its connection with some graph called dependency graph of the system. Various algebraic properties are presented.