相关论文: Automaticity and invariant measures of linear cell…
For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
Let $G$ be a group and $A$ a set equipped with a collection of finitary operations. We study cellular automata $\tau : A^G \to A^G$ that preserve the operations of $A^G$ induced componentwise from the operations of $A$. We show that $\tau$…
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on higher dimensional CA and aims at showing that the situation is different…
We show that for every "locally finite" unit-preserving completely positive map P acting on a C*-algebra, there is a corresponding *-automorphism \alpha of another unital C*-algebra such that the two sequences P, P^2,P^3,... and \alpha,…
Let the map $f:[-1,1]\to[-1,1]$ have a.c.i.m. $\rho$ (absolutely continuous $f$-invariant measure with respect to Lebesgue). Let $\delta\rho$ be the change of $\rho$ corresponding to a perturbation $X=\delta f\circ f^{-1}$ of $f$. Formally…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…
We study two families of excitable cellular automata known as the Greenberg-Hastings Model (GHM) and the Cyclic Cellular Automaton (CCA). Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and we…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
In this paper, we study certain dynamical properties of dill maps, a class of functions introduced in~\cite{salo2015block} that generalizes both cellular automata and substitutions. In particular, we prove that surjective uniform dill maps…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
We consider the family of piecewise linear maps $$F_{a,b}(x,y)=\left(|x| - y + a, x - |y| + b\right),$$ where $(a,b)\in \mathbb{R}^2$. This family belongs to a wider one that has deserved some interest in the recent years as it provides a…
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…