Related papers: A strongly universal cellular automaton with four …
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…
In this paper, we look at the extention of Hedlund's characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an additionnal condition. The new theorem is proved with full details in the…
We study two-dimensional cellular automata, each cell takes three states: resting, excited and refractory. A resting cell excites if number of excited neighbours lies in a certain interval (excitation interval). An excited cell become…
We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…
We study fourfold rotation invariant gapped topological systems with time-reversal symmetry in two and three dimensions ($d=2,3$). We show that in both cases nontrivial topology is manifested by the presence of the $(d-2)$-dimensional edge…
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which…
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…
This contribution belongs to a combinatorial approach to hyperbolic geometry and it is aimed at possible applications to computer simulations. It is based on the splitting method which was introduced by the author and which is reminded in…
In this work we provide analytic results of infinite one-dimensional cellular automaton(CA). By realizing symbolic products, we investigate a subclass of infinite CA and prove analytically that within this subclass the only allowed…
The positive rates conjecture states that a one-dimensional probabilistic cellular automaton (PCA) with strictly positive transition rates must be ergodic. The conjecture has been refuted by G\'acs, whose counterexample is a cellular…
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…
A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their…
We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models, and we characterise their quantum phase transition, when in the presence of a…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
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…
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets…
We prove that symplectic 4-manifolds with $b_1 = 0$ and $b^+ > 1$ have nonvanishing Donaldson invariants, and that the canonical class is always a basic class. We also characterize in many situations the basic classes of a Lefschetz…
Two cellular automata are strongly conjugate if there exists a shift-commuting conjugacy between them. We prove that the following two sets of pairs $(F,G)$ of one-dimensional one-sided cellular automata over a full shift are recursively…
In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…