元胞自动机与格子气

The parity of a bit string of length $N$ is a global quantity that can be efficiently compute using a global counter in ${O} (N)$ time. But is it possible to find the parity using cellular automata with a set of local rule tables without…

We conjecture that for a wide class of interacting particle systems evolving in discrete time, namely conservative cellular automata with piecewise linear flow diagram, relaxation to the limit set follows the same power law at critical…

An exact solution for a high speed deterministic traffic model with open boundaries and synchronous update rule is presented. Because of the strong correlations in the model, the qualitative structure of the stationary state can be…

Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…

In this paper, we study a famous discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of…

Through an extension of the ultradiscretization for the optimal velocity (OV) model, we introduce an ultradiscretizable traffic flow model, which is a hybrid of the OV and the slow-to-start (s2s) models. Its ultradiscrete limit gives a…

We investigate epidemic models with spatial structure based on the cellular automata method. The construction of the cellular automata is from the study by Weimar and Boon about the reaction-diffusion equations [Phys. Rev. E 49, 1749…

We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two…

An experimental analysis of the asynchronous version of the "Game of Life" is performed to estimate how topology perturbations modify its evolution. We focus on the study of a phase transition from an "inactive-sparse phase" to a "labyrinth…

Fredkin's Billiard Ball Model (BBM) is considered one of the fundamental models of collision-based computing, and it is essentially based on elastic collisions of mobile billiard balls. Moreover, fixed mirrors or reflectors are brought into…

In 2005, Nagler and Claussen (Phys. Rev. E 71 (2005) 067103) investigated the time series of the elementary cellular automata (ECA) for possible (multi)fractal behavior. They eliminated the polynomial background at^b through the direct…

In this article, we have proposed an epidemic model by using probability cellular automata theory. The essential mathematical features are analyzed with the help of stability theory. We have given an alternative modelling approach for the…

In this paper, we propose the ultra-discrete optimal velocity model, a cellular-automaton model for traffic flow, by applying the ultra-discrete method for the optimal velocity model. The optimal velocity model, defined by a differential…

Traditional sampling theories consider the problem of reconstructing an unknown signal $x$ from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that $x$ lies in a known subspace.…

This paper presents solutions to Density Classification Task (DCT) using a variant of Cellular Automata (CA) called Programmable Cellular Automata (PCA). The translation property as well as the density preserving property of fundamental CA…

The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…

A bottleneck simulation of road traffic on a loop, using the deterministic cellular automata (CA) Nagel-Schreckenberg model with zero dawdling probability, reveals three types of stationary wave solutions. They consist of i) two shock…

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…

We propose a novel multi-layered nonlinear model that is able to capture and predict the housing-demographic dynamics of the real-state market by simulating the transitions of owners among price-based house layers. This model allows us to…

This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and…