Related papers: Simulations between triangular and hexagonal numbe…
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream sequences. In this paper we present two families of…
Gravitational clustering of a random distribution of point masses is dominated by the effective short-range interactions due to large-scale isotropy. We introduce a one-dimensional cellular automaton to reproduce this effect in the most…
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
We consider transformations between attractor basins of binary cylindrical cellular automata resulting from mutations. A t-point mutation of a state consists in toggling t sites in that state. Results of such mutations are described by a…
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…
This paper firstly show that a recent model (Tian et al., Transpn. Res. B 71, 138-157, 2015) is not able to well replicate the evolution concavity in traffic flow, i.e. the standard deviation of vehicles increases in a concave/linear way…
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…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…
Precipitation/dissolution reactions coupled with solute transport are modelled as a cellular automaton in which solute molecules perform a random walk on a regular lattice and react according to a local probabilistic rule. Stationary solid…
Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements…
If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain "odd-rule" CAs, including Rule 150, Rule 614, and Fredkin's Replicator, the answer can be found by using the…
In this paper, we give an elaborate and understandable review of traffic cellular automata (TCA) models, which are a class of computationally efficient microscopic traffic flow models. TCA models arise from the physics discipline of…
We present Mass-Conserving Evolution (MaCE), a general method for implementing mass conservation in Cellular Automata (CA). MaCE is a simple evolution rule that can be easily 'attached' to existing CAs to make them mass-conserving, which…
Tumor growth from a single transformed cancer cell up to a clinically apparent mass spans many spatial and temporal orders of magnitude. Implementation of cellular automata simulations of such tumor growth can be straightforward but…
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations…
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call…
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…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata…