Related papers: Nonsynchronous updating in the multiverse of cellu…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
Among the fundamental questions in computer science is that of the impact of synchronism/asynchronism on computations, which has been addressed in various fields of the discipline: in programming, in networking, in concurrence theory, in…
In this paper, we study the effect of (a)synchronism on the dynamics of elementary cellular automata. Within the framework of our study, we choose five distinct update schemes, selected from the family of periodic update modes: parallel,…
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…
We study two common types of time-noncontinuous updates for one dimensional stochastic cellular automata with arbitrary nearest neighbor interactions and arbitrary open boundary conditions. We first construct the stationary states using the…
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…
This study introduces Skewed Fully Asynchronous Cellular Automata (SACA), a novel update scheme in cellular automata that updates the states of only two consecutive and adjacent cells, such as ci and ci+1, simultaneously at each time step.…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…
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.…
Probabilistic cellular automata provide a simple framework for the exploration of classical nonequilibrium processes. Recently, quantum cellular automata have been proposed that rely on the propagation of a one-dimensional quantum state…
In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
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…
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…
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…
There are few known universality classes of absorbing phase transitions in one dimension and most models fall in the well-known directed percolation (DP) class. Synchronization is a transition to an absorbing state and this transition is…
The synchronization of two stochastically coupled one-dimensional cellular automata (CA) is analyzed. It is shown that the transition to synchronization is characterized by a dramatic increase of the statistical complexity of the patterns…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
How do update rules affect the dynamical and steady state properties of a flock? In this study, we have explored the active Ising spins (s = +-1) in one dimension, where spin updates its orientation according to the Metropolis algorithm…