Related papers: Cellular Automaton Rule184++C. A Simple Model for …
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
We present results on the modeling of on- and off-ramps in cellular automata for traffic flow, especially the Nagel-Schreckenberg model. We study two different types of on-ramps that cause qualitatively the same effects. In a certain…
In recent years statistical physicists have developed {\it discrete} "particle-hopping" models of vehicular traffic, usually formulated in terms of {\it cellular automata}, which are similar to the microscopic models of interacting charged…
Although coarse-grained models have been widely used to explain exotic phenomena in complex fluids, such as droplet formation in living cells, these conventional approaches often fail to capture the intricate microscopic degrees of freedom…
We use a cellular automata approach to numerically investigate traffic flow patterns on a single lane. The free-flow phase (F), the synchronized phase (S), and the jam phase (J) are observed and the transitions among them are studied as the…
This paper investigates the $k$-mixing property of a multidimensional cellular automaton. Suppose $F$ is a cellular automaton with the local rule $f$ defined on a $d$-dimensional convex hull $\mathcal{C}$ which is generated by an apex set…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
We study numerically how multiple deformable capsules squeeze into a constriction. This situation is largely encountered in microfluidic chips designed to manipulate living cells, which are soft entities. We use fully three-dimensional…
We present some computer simulations run on a stochastic CA (cellular automaton). The CA simulates a gas of particles which are in a channel, the interval $[1,L]$ in $\mathbb Z$, but also in "reservoirs" $\mathcal R_1$ and $\mathcal R_2$.…
In this paper we propose a rule-independent description of applications of cellular automata rules for one-dimensional additive cellular automata on cylinders of finite sizes. This description is shown to be a useful tool for for answering…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like…
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets…
Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally…
In this paper, we explore the two-dimensional behavior of cellular automata with shuffle updates. As a test case, we consider the evacuation of a square room by pedestrians modeled by a cellular automaton model with a static floor field.…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
One key challenge in Artificial Life is designing systems that display an emergence of complex behaviors. Many such systems depend on a high-dimensional parameter space, only a small subset of which displays interesting dynamics. Focusing…
To identify potential universal cellular automata, a method is developed to measure information processing capacity of elementary cellular automata. We consider two features of cellular automata: Ability to store information, and ability to…
We analyze the steady-state flow as a function of the initial density for a class of deterministic cellular automata rules (``traffic rules'') with periodic boundary conditions [H. Fuks and N. Boccara, Int. J. Mod. Phys. C 9, 1 (1998)]. We…
A general family of $D$-dimensional, $K$-state cellular automata is proposed where the update rule is sequentially applied in each dimension. This includes the Biham--Middleton--Levine traffic model, which is a 2D cellular automaton with 3…