Related papers: Directional Dynamics along Arbitrary Curves in Cel…
Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements…
Among the fundamental questions in computer science is that of the impact of synchronism/asynchronism on computations, which has been addressed in various fields of the discipline: in programming, in networking, in concurrence theory, in…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterized by having its heads…
Cellular automata provide models of parallel computation based on cells, whose connectivity is given by an action of a monoid on the cells. At each step in the computation, every cell is decorated with a state that evolves in discrete steps…
The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…
We use analytical methods to investigate cellular automata for traffic flow. Two different mean-field approaches are presented, which we call site-oriented and car-oriented, respectively. The car-oriented mean-field theory yields the exact…
In this article, we consider a topological dynamical system. The generic limit set is the smallest closed subset which has a comeager realm of attraction. We study some of its topological properties, and the links with equicontinuity and…
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…
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
Hardly any real self-propelling or actively driven object is perfect. Thus, undisturbed motion will generally not follow straight lines but rather circular trajectories. We here address self-propelled or actively driven objects that move in…
We consider a graph with a single quantum system at each node. The entire compound system evolves in discrete time steps by iterating a global evolution $U$. We require that this global evolution $U$ be unitary, in accordance with quantum…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by…
We study the statistical properties of a cellular automata model of traffic flow with the look-ahead potential. The model defines stochastic rules for the movement of cars on a lattice. We analyze the underlying statistical assumptions…
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be…
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…
Excitable cellular automata with dynamical excitation interval exhibit a wide range of space-time dynamics based on an interplay between propagating excitation patterns which modify excitability of the automaton cells. Such interactions…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time…