Related papers: Touching Loop Patterns with Cellular Automata
In three spatial dimensions, communication channels are free to pass over or under each other so as to cross without intersecting; in two dimensions, assuming channels of strictly positive thickness, this is not the case. It is natural,…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
This paper describes a new concept of cellular automaton (CA). XCA consists of a set of arcs (edges) that correspond to cells in CA. At a particular time, the arcs are connected to a directed graph. With each time step, the arcs exchange…
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…
Tile Automata is a recently defined model of self-assembly that borrows many concepts from cellular automata to create active self-assembling systems where changes may be occurring within an assembly without requiring attachment. This model…
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their neighbors. Its trace is the set of infinite words representing…
Living organisms interact with their surroundings in a closed-loop fashion, where sensory inputs dictate the initiation and termination of behaviours. Even simple animals are able to develop and execute complex plans, which has not yet been…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular…
In this paper a method is proposed which uses data mining techniques based on rough sets theory to select neighborhood and determine update rule for cellular automata (CA). According to the proposed approach, neighborhood is detected by…
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
The phase diagram of the coupled sine circle map lattice shows spatio-temporal intermittency of two distinct types: spatio-temporal intermittency of the directed percolation (DP) class, and spatial intermittency which does not belong to…
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…
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…
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…
Sustained rhythmic oscillations, pulsing dynamics, emerge spontaneously when the local connection scheme is randomised in 3-value cellular automata that feature"glider" dynamics. Time-plots of pulsing measures maintain a distinct waveform…
The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…
Elementary cellular automata deterministically map a binary sequence to another using simple local rules. Visualizing the structure of this mapping is difficult because the number of nodes (i.e. possible binary sequences) grows…