Summary: In the development of mathematical foundations for a theory of simulation, a certain class of discrete Sequential Dynamical Systems (SDS) is of particular importance. These systems which we refer to as SDS consist of: (a) a graph \(Y\) with vertex set \(\{1,2,\dots,n\}\), where each vertex has associated a binary state, (b) a vertex labeled set of functions \(F_{i,Y}\colon\mathbb F^n_2\to\mathbb F^n_2\), and (c) a permutation \(\pi\in S_n\). The function \(F_{i,Y}\) updates the state of vertex \(i\) as a function of the states of vertex \(i\) and its \(Y\)-neighbors and leaves all other states invariant. By composing these functions in the order given by \(\pi\), we obtain the SDS \[ [F_Y,\pi]=\prod^n_{i=1}F_{\pi(i),Y}\colon\mathbb F^n_2\to\mathbb F^n_2. \] In this paper, we give a combinatorial upper bound for the number of non-equivalent SDS for a given graph, and we compute this bound explicitly for certain classes of graphs. We give a full characterization of invertible SDS, and analyze the set of fixed points of sequential and parallel cellular automata. Further, we introduce the concept of Maj-type SDS and show that systems of this class only have fixed points as attractors. Finally, we analyze SDS that are fixed point free for arbitrary base graphs.
For Parts I, II and IV, cf. Appl. Math. Comput. 98, 241–259 (1999; Zbl 0927.68114), ibid. 107, 121–136 (2000; Zbl 1049.68149), and ibid. 134, 153–171 (2003; Zbl 1028.37010), respectively.