Elementary Cellular Automata as Invariant under Conjugation Transformation or Combination of Conjugation and Reflection Transformations, and Applications to Traffic Modeling

This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell. We consider a new concept. This concept is the average velocity of a cellular automaton, which characterizes the average intensity of changes in the states of the automaton’s cells for a given initial state. The automaton velocity is equal to 1 if the state of any cell changes at each step. The spectrum of average velocities of a cellular automaton is the set of average velocities for different initial states. Since the state space is finite, the automaton, starting from a certain moment of time, is in periodically repeating states of a cycle, and thus, the research of the velocity spectrum is related to the problem of studying the set of the automaton cycles. For elementary cellular automata, the introduced class consists of a subclass of automata such that the conjugation trasformation of an automaton is the automaton itself (Subclass A) or the reflection of the automaton (Subclass B). For this class, it is proved that the spectrum of the automaton contains the value v0 if and only if the spectrum of the complementary automaton contains the value 1−v0 (the sum of the index of elementary cellular automaton and the complementary automaton is 255). For automata of Subclasses A and B, the set of cycles and the velocity spectrum are studied. For Subclass A, a theorem has been proved such that in accordance with this theorem, if two automata complementary to each other start evolving in the same initial state, then the sum of their average velocities is equal to 1. This theorem for Subclass A is generalized to cellular automata, invariant under the conjugation transformation, of more general type than elementary automata. Generalizations of the theorem have been given for the class of one-dimensional cellular automata with a neighborhood containing 2r+1 cells (the next state of the cell depends on the present states of this cell, r cells on the left and r cells on the right) and for some traditionally considered classes of two-dimensional automata. Some elementary cellular automata belonging to the class considered in the paper can be interpreted as transport models. The properties of the spectra for these automata are studied and compared with the properties of elementary cellular automata not invariant under the considered transformations and can also be interpreted as transport models. The analytical results obtained for these simple models can be used to study the qualitative properties and limiting behavior of more complex transport models.