Search

We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions [1]. These systems can be considered as sequential dynamical systems (SDS) over words, a class of dynamical systems that consists of (a) a finite, labeled graph Y with vertex set {v1,...,vn} and where each vertex vi has a state xvi in a finite field K, (b) a sequence of functions (Fvi,Y)i, and (c) a word w = (w1,...,wk), where each wi is a vertex in Y. The function Fvi,Y updates the state of vertex vi as a function of the state of vi and its Y-neighbors and maps all other vertex states identically. The SDS is the composed map $[\mathfrak{F}_Y,w]=\prod_{i=1}^{k} F_{w_{i}}: K^n\rightarrow K^n$. In the particular case of ACA, the graph is the circle graph on n vertices (Y = Circn), and all the maps Fvi are induced by a common Boolean function. Our main result is the identification of all w-independent ACA, that is, all ACA with periodic points that are independent of the word (update schedule) w. In general, for each w-independent SDS, there is a finite group whose structure contains information about for example SDS with specific phase space properties. We classify and enumerate the set of periodic points for all w-independent ACA, and we also compute their associated groups in the case of Y = Circ4. Finally, we analyze invertible ACA and offer an interpretation of S35 as the group of an SDS over the three-dimensional cube with local functions induced by nor3 + nand3. [ABSTRACT FROM AUTHOR]