Related papers: Gliders on the Stranded Cellular Automata Model
A general stochastic traffic cellular automaton (CA) model, which includes slow-to-start effect and driver's perspective, is proposed in this paper. It is shown that this model includes well known traffic CA models such as…
In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
Modeling the ability of multicellular organisms to build and maintain their bodies through local interactions between individual cells (morphogenesis) is a long-standing challenge of developmental biology. Recently, the Neural Cellular…
We consider the problem of embedding odometers in one-dimensional cellular automata. We show that (1) every odometer can be be embedded in a gliders with reflecting walls cellular automaton, which one depending on the odometer, and (2) an…
Exactly ergodicity in boundary-driven semi-infinite cellular automata (CA) are investigated. We establish all the ergodic rules in CA with 3, 4, and 5 states. We analytically prove the ergodicity for 12 rules in 3-state CA and 118320 rules…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
We discuss a class of cellular automata (CA) able to produce long random strings, starting from short "seed" strings. The approach uses two principles borrowed from cryptography: diffusion and confusion. We show numerically that the strings…
A numerical model is developed for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbors according to established…
We investigate a cellular automaton (CA) model of traffic on a bi-directional two-lane road. Our model is an extension of the one-lane CA model of {Nagel and Schreckenberg 1992}, modified to account for interactions mediated by passing, and…
The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…
A new class of automata networks is defined. Their evolution rules are determined by a probability measure p on the set of all integers Z and an indicator function I_A on the interval [0,1]. It is shown that any cellular automaton rule can…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
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 Isliker et al. (2000b), an extended cellular automaton (X-CA) model for solar flares was introduced. In this model, the interpretation of the model's grid-variable is specified, and the magnetic field, the current, and an approximation…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
We study the class of asynchronous non-uniform cellular automata (ANUCA) over an arbitrary group universe with multiple local transition rules. We introduce the notion of stable injectivity, stable reversibility, stable post-surjectivity…
Memristors are novel non volatile devices that manage to combine storing and processing capabilities in the same physical place.Their nanoscale dimensions and low power consumption enable the further design of various nanoelectronic…
We propose and investigate a probabilistic model of sublinear-time one-dimensional cellular automata. In particular, we modify the model of ACA (which are cellular automata that accept if and only if all cells simultaneously accept) so that…