Related papers: Multiplicative Cellular Automata on Nilpotent Grou…

Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous, sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a closed,…

It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. It has been shown that such patterns can occur when the alphabet is…

A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…

Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…

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 provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…

Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…

Let $d > 1$, and let $(X,\alpha)$ and $(Y,\beta)$ be two zero-entropy ${\mathbb{Z}}^d$-actions on compact abelian groups by $d$ commuting automorphisms. We show that if all lower rank subactions of $\alpha$ and $\beta$ have completely…

We provide microscopic diagrammatic derivations of the Molecular Coherent Potential Approximation (MCA) and Dynamical Cluster Approximation (DCA) and show that both are Phi-derivable. The MCA (DCA) maps the lattice onto a self-consistently…

For non-uniform cellular automata (NUCA) with finite memory over an arbitrary universe with multiple local transition rules, we show that pointwise nilpotency, pointwise periodicity, and pointwise eventual periodicity properties are…

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

This paper presents a rotation-invariant embedded platform for simulating (neural) cellular automata (NCA) in modular robotic systems. Inspired by previous work on physical NCA, we introduce key innovations that overcome limitations in…

A class of almost paratopological groups is introduced, which (1) contains paratopological groups and Hausdorff quasitopological groups; (2) is closed under products; (3) subgroups. Almost paratopological $T_1$ groups $G$ are characterized…

We present a method for construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that…

We consider discrete dynamical systems and lattice models in statistical mechanics from the point of view of their symmetry groups. We describe a C program for symmetry analysis of discrete systems. Among other features, the program…

We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…

Memristors are novel non volatile devices that manage to combine storing and processing capabilities in the same physical place.Their nanoscale dimensions and low power consumption enable the further design of various nanoelectronic…

Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…

We introduce an extension of classical cellular automata (CA) to arbitrary labeled graphs, and show that FO logic on CA orbits is equivalent to MSO logic. We deduce various results from that equivalence, including a characterization of…

Relation between global transition function and local transition function of a homogeneous one dimensional cellular automaton (CA) is investigated for some standard transition functions. It could be shown that left shift and right shift CA…