Related papers: A weakly universal cellular automaton in the hepta…
A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its evolution. It can be seen as a kind of modelization of the physical…
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…
The generic limit set of a cellular automaton is a topologically dened set of congurations that intends to capture the asymptotic behaviours while avoiding atypical ones. It was dened by Milnor then studied by Djenaoui and Guillon rst, and…
We propose a general method for constructing a fuzzy cellular automaton from a given cellular automaton. Unlike previous approaches that use fuzzy distinctive normal form, whose update function is restricted to third-order polynomials, our…
In this paper, we revisit a classic example of probabilistic cellular automaton (PCA) on {0, 1} Z , namely, addition modulo 2 of the states of the left-and right-neighbouring cells, followed by either preserving the result of the addition,…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…
The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…
This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of permutivity as a key factor influencing these properties and…
The aim of this paper is to describe the classes of strongly flat and weakly cotorsion modules with respect to a multiplicative subset or a finite collection of multiplicative subsets in a commutative ring. The strongly flat modules are…
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…
Consider the domain $E$ in $\mathbb{C}^3$ defined by $$ E=\{(a_{11},a_{22},\text{det}A): A=\begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}\text{ with }\lVert A \rVert <1\}. $$ This is called the tetrablock. This paper…
Let $V_{L}$ be the vertex algebra associated to a non-degenerate even lattice $L$, $\theta$ the automorphism of $V_{L}$ induced from the $-1$ symmetry of $L$, and $V_{L}^{+}$ the fixed point subalgebra of $V_{L}$ under the action of…
We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
For a cellular algebra $\A$ with a cellular basis $\ZC$, we consider a decomposition of the unit element $1_\A$ into orthogonal idempotents (not necessary primitive) satisfying some conditions. By using this decomposition, the cellular…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
For any group $G$ and set $A$, a cellular automaton over $G$ and $A$ is a transformation $\tau : A^G \to A^G$ defined via a finite neighborhood $S \subseteq G$ (called a memory set of $\tau$) and a local function $\mu : A^S \to A$. In this…
We investigate the sensitivity of the composite cellular automaton of H. Fuk\'{s} [Phys. Rev. E 55, R2081 (1997)] to noise and assess the density classification performance of the resulting probabilistic cellular automaton (PCA)…