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 veloci...
Main Authors: | Valery Kozlov, Alexander Tatashev, Marina Yashina |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-09-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/19/3541 |
Similar Items
-
Entropy-Based Classification of Elementary Cellular Automata under Asynchronous Updating: An Experimental Study
by: Qin Lei, et al.
Published: (2021-02-01) -
A cellular automata ship traffic flow model considering navigation rules in narrowing channel
by: Liang Chen, et al.
Published: (2023-04-01) -
Traffic flow simulation of modified cellular automata model based on producer-consumer algorithm
by: Xuefeng Deng, et al.
Published: (2022-09-01) -
Integrated applications of cellular automata /
by: Simons, Novak, editor
Published: (2015) -
Quantum cellular automata : theory, experimentation and prospects /
by: Macucci, Massimo
Published: (2006)