Related papers: Cellular Automaton Rule184++C. A Simple Model for …
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…
This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Simple cellular automata models are able to reproduce the basic properties of highway traffic. The comparison with empirical data for microscopic quantities requires a more detailed description of the elementary dynamics. Based on existing…
It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…
We present computer simulations run with a stochastic cellular automaton which describes $d=1$ particle systems connected to reservoirs which keep two different densities at the endpoints. We fix the parameters so that there is a phase…
The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary…
A general stochastic traffic cellular automaton (CA) model, which includes slow-to-start effect and driver's perspective, is proposed in this paper. It is shown that this model includes well known traffic CA models such as…
We study spontaneous symmetry breaking in a one-dimensional driven two-species stochastic cellular automaton with parallel sublattice update and open boundaries. The dynamics are symmetric with respect to interchange of particles. Starting…
A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…
Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the…
In this study, we provide a novel approach for modelling the mixed traffic flow. The basic idea is to integrate models for nonmotorized vehicles (nm-vehicles) with models for motorized vehicles (m-vehicles). Based on the idea, a model for…
The cellular automaton model is used to simulate diffusion and aggregation with dissociation of point particles in 2D. A continuous phase transition is found that separates creation of compact aggregates and fractal ones. The transition is…
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system --- when enriched with memory -- hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced…
It is suggested that the question of existence of a jamming phase transition in a broad class of single-lane cellular-automaton traffic models may be studied using a correspondence to the asymmetric chipping model. In models where such…