Related papers: Orbits in one-dimensional finite linear cellular a…
We discuss a cellular automaton simulating the process of reaching Heider balance in a fully connected network. The dynamics of the automaton is defined by a deterministic, synchronous and global update rule. The dynamics has a very rich…
A soliton cellular automaton on a one dimensional semi-infinite lattice with a reflecting end is presented. It extends a box-ball system on an infinite lattice associated with the crystal base of U_q(sl_n). A commuting family of time…
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for \cas to be number-conserving is proved. Using this condition, we give a linear-time algorithm to…
We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations…
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and…
We study the out-of-equilibrium dynamics of the quantum cellular automaton known as "Rule 54". For a class of low-entangled initial states, we provide an analytic description of the effect of the global evolution on finite subsystems in…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
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…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
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…
Hybrid dynamical systems have proven to be a powerful modeling abstraction, yet fundamental questions regarding the dynamical properties of these systems remain. In this paper, we develop a novel class of relaxations which we use to recover…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift.
Periodic orbits are fundamental to understand the dynamics of nonlinear systems. In this work, we focus on two aspects of interest regarding periodic orbits, in the context of a dissipative mapping, derived from a prototype model of a…