Related papers: Gliders on the Stranded Cellular Automata Model
We discuss some properties of a class of cellular automata sometimes called a "generalized ant". This system is perhaps most easily understood by thinking of an ant which moves about a lattice in the plane. At each vertex (or "cell"), 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…
In this study, we provide a novel approach for modelling the mixed traffic flow. The basic idea is to integrate models for nonmotorized vehicles (nm-vehicles) with models for motorized vehicles (m-vehicles). Based on the idea, a model for…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…
The results of Kermack-McKendrick SIR model are planned to be reproduced by cellular automata (CA) lattice model. The CA algorithms are proposed to study the model of epidemic, systematically. The basic goal is to capture the effects of…
We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…
Neural Cellular Automata (NCAs) are bio-inspired dynamical systems in which identical cells iteratively apply a learned local update rule to self-organize into complex patterns, exhibiting regeneration, robustness, and spontaneous dynamics.…
Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be modeled using many different techniques like Rule matrices, State Transition Diagrams, Boolean functions, Algebraic Normal Form etc. In this paper, a new model is…
To understand the underlying principles of self-organisation and computation in cellular automata, it would be helpful to find the simplest form of the essential ingredients, glider-guns and eaters, because then the dynamics would be easier…
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…
Dynamic Traffic Assignment (DTA) provides an approach to determine the optimal path and/or departure time based on the transportation network characteristics and user behavior (e.g., selfish or social). In the literature, most of the…
We propose a method for deriving networks from one-dimensional binary cellular automata. The derived networks are usually directed and have structural properties corresponding to the dynamical behaviors of their cellular automata. Network…
We introduce our GraftalLace Cellular Automaton in short GLCA which is a new one-dimensional cellular automaton on the regular square lattice. It makes a monochromatic infinite directed graph otherwise an octal number triangle or number…
The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA), a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs). The fundamental computation units of the model are…
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity…
In this paper we propose a rule-independent description of applications of cellular automata rules for one-dimensional additive cellular automata on cylinders of finite sizes. This description is shown to be a useful tool for for answering…
We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…
We investigate one-dimensional Probabilistic Cellular Automata, called Diploid Elementary Cellular Automata (DECA), obtained as random mixture of two different Elementary Cellular Automata rules. All the cells are updated synchronously and…