Related papers: Minimal Glider-Gun in a 2D Cellular Automaton
This paper proposes a new pattern of two dimensional cellular automata linear rules that are used for efficient edge detection of an image. Since cellular automata is inherently parallel in nature, it has produced desired output within a…
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…
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA)…
We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
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.…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This…
In this paper, we mainly study linear one-dimensional and two-dimensional elementary cellular automata that generate symmetrical spatio-temporal patterns. For spatio-temporal patterns of cellular automata from the single site seed, we…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
Computing the configuration of any one-dimensional cellular automaton at generation $n$ can be accelerated by constructing and running a composite rule with a radius proportional to $\log n$. The new automaton is the original one, but with…
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular…
An N-component continuous-time dynamic system is considered whose components evolve autonomously all the time except for in discrete asynchronous instances of pairwise interactions. Examples include chaotically colliding billiard balls and…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
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…
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$…
This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular…
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed…