Related papers: Computation with competing patterns in Life-like a…
Metastability is observed when a physical system is close to a first order phase transition. In this paper the metastable behavior of a two state reversible probabilistic cellular automaton with self-interaction is discussed. Depending on…
We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction…
We use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
Various non-classical approaches of distributed information processing, such as neural networks, computation with Ising models, reservoir computing, vector symbolic architectures, and others, employ the principle of collective-state…
Some deterministic cellular automata have been observed to follow the pattern of the second law of thermodynamics: starting from a partially disordered state, the system evolves towards a state of equilibrium characterized by maximal…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
In addition to the $\lambda$ parameter, we have found another parameter which characterize the class III, class II and class IV patterns more quantitatively. It explains why the different classes of patterns coexist at the same $\lambda$.…
We propose an iterative algorithm to investigate the cooperative evolution dominated by information encoded within state spaces in a random quantum cellular automaton. Inspired by the 2-gram model in statistical linguistics, the updates of…
We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-neighbour cellular automata (CA) with three states. We construct a 3-state rule by "lifting" elementary CA rule 140. Such "lifted" rule is equivalent to…
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…
The one-dimensional three-state cyclic cellular automaton is a simple spatial model with three states in a cyclic "rock-paper-scissors" prey-predator relationship. Starting from a random configuration, similar states gather in increasingly…
Individual cellular automata rules are attractive models for a range of biological and physical self-assembling systems. While coexpression and coevolution are common in such systems, ensembles of cellular automata rules remain poorly…
Motivated by questions in biology and distributed computing, we investigate the behaviour of particular cellular automata, modelled as one-dimensional arrays of identical finite automata. We investigate what sort of self-stabilising…
What substrate features allow life? We exhaustively classify all 262,144 outer-totalistic binary cellular automata rules with Moore neighbourhood for self-replication and produce phase diagrams in the $(\lambda, F)$ plane, where $\lambda$…
A cellular automaton in which cells represent agents playing the Prisoner's Dilemma (PD) game following the simple "win-stay, loose-shift" strategy is studied. Individuals with binary behavior, such as they can either cooperate (C) or…
Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of the states $0,1,..., n-1$, can you find out the most frequently occurring state using cellular automaton? Here, we prove that while the…
We introduce a pair of time-reversible models defined on the discrete space-time lattice with 3 states per site, specifically, a vacancy and a particle of two flavours (species). The local update rules reproduce the rule 54 reversible…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…