Related papers: Further travels with my ant
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…
Cells coexist together in colonies or as tissues. Their behaviour is controlled by an interplay between intercellular forces and biochemical regulation. We develop a simple model of the cell cycle, the fundamental regulatory network…
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
We obtained the exact solution of a probabilistic cellular automaton related to the diagonal-to-diagonal transfer matrix of the six-vertex model on a square lattice. The model describes the flow of ants (or particles), traveling on a…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
The Stranded Cellular Automata (SCA) model consists of a grid of cells which can each contain between zero and two strands apiece and two turning rules that control when strands turn and when they cross. While patterns on this model have…
Many ant species employ distributed population density estimation in applications ranging from quorum sensing [Pra05], to task allocation [Gor99], to appraisal of enemy colony strength [Ada90]. It has been shown that ants estimate density…
Myxococcus xanthus cells self-organize into aligned groups, clusters, at various stages of their lifecycle. Formation of these clusters is crucial for the complex dynamic multi-cellular behavior of these bacteria. However, the mechanism…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
With the increasing demand and complexity of networks, factors such as balancing the load, improving the performance, reducing delay and finding optimal path between nodes in a computer network have become crucial. The traditional routing…
A general family of $D$-dimensional, $K$-state cellular automata is proposed where the update rule is sequentially applied in each dimension. This includes the Biham--Middleton--Levine traffic model, which is a 2D cellular automaton with 3…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
Biological swarms, such as ant colonies, achieve collective goals through decentralized and stochastic individual behaviors. Similarly, physical systems composed of gases, liquids, and solids exhibit random particle motion governed by…
In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and…
Cellular automata provide a fascinating class of dynamical systems capable of diverse complex behavior. These include simplified models for many phenomena seen in nature. Among other things, they provide insight into self-organized…
Reversible Probabilistic Cellular Automata are a special class of automata whose stationary behavior is described by Gibbs-like measures. For those models the dynamics can be trapped for a very long time in states which are very different…
We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…
The transition structure of an automaton can be used to create a natural topology to the set of states of an automaton, generating, this way, a topological space. Probabilistic automata can also be modeled in terms of measure theory. A…