Related papers: Coarse-grained cellular automaton for traffic syst…
The cellular automata with local permutation invariance are considered. We show that in the two-state case the set of such automata coincides with the generalized Game of Life family. We count the number of equivalence classes of the rules…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
Computing the configuration of any one-dimensional cellular automaton at generation $n$ can be accelerated by constructing and running a composite rule with a radius proportional to $\log n$. The new automaton is the original one, but with…
Two simple Cellular Automata, which mimic the Collatz-Ulam iterated map (3x+1 map), are introduced. These Cellular Automata allow to test efficiently the Collatz conjecture for very large numbers.
We study the effect of mixing two rules on the dynamics of one-dimensional cellular automata by large scale numerical simulations. We calculate the decay of the magnetization for the Domany-Kinzel automaton (XOR/AND mixing) to its…
In this paper we study the statistical properties of a reversible cellular automaton in two out-of-equilibrium settings. In the first part we consider two instances of the initial value problem, corresponding to the inhomogeneous quench and…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
The cooperation of connected and automated vehicles (CAVs) has shown great potential in improving traffic efficiency during intersection management. Existing research mainly focuses on intersections where lane changing is prohibited, which…
Measurements on real traffic have revealed the existence of metastable states with very high flow. Such states have not been observed in the Nagel-Schreckenberg (NaSch) model which is the basic cellular automaton for the description of…
Effects of large value assigned to the maximal car velocity on the fundamental diagrams in the Nagel-Schreckenberg model are studied by extended simulations. The function relating the flow in the congested traffic phase with the car density…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
The calcium transport in biological systems is modelled as a reaction-diffusion process. Nonlinear calcium waves are then simulated using a stochastic cellular automaton whose rules are derived from the corresponding coupled partial…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…
In this paper computer simulation results of higher order density correlation for cellular automaton models of traffic flow are presented. The examinations show the jamming transition as a function of both the density and the magnitude of…
We present in this article an algebraic approach to model and simulate road traffic networks. By defining a set of road traffic systems and adequate concatenating operators in that set, we show that large regular road networks can be easily…
We study a two-dimensional semi-totalistic binary cell-state cellular automaton, which imitates a reversible precipitation in an abstract chemical medium. The systems exhibits a non-trivial growth and nucleation. We demonstrate how basic…