English
Related papers

Related papers: Limit Measures for Affine Cellular Automata

200 papers

If M is a monoid (e.g. the lattice Z^D), and A is an abelian group, then A^M is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. If F is diffusive, and…

Dynamical Systems · Mathematics 2009-09-25 Marcus Pivato , Reem Yassawi

Let M=Z^D be a D-dimensional lattice, and let A be an abelian group. A^M is then a compact abelian group; a `linear cellular automaton' (LCA) is a topological group endomorphism \Phi:A^M --> A^M that commutes with all shift maps. Suppose…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato , Reem Yassawi

If A=Z/2, then A^Z is a compact abelian group. A `linear cellular automaton' is a shift-commuting endomorphism F of A^Z. If P is a probability measure on A^Z, then F `asymptotically randomizes' P if F^j P converges to the Haar measure as…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

Suppose R is a finite commutative ring of prime characteristic, A is a finite R-module, M:=Z^D x N^E, and F is an R-linear cellular automaton on A^M. If mu is an F-invariant measure which is multiply shift-mixing in a certain way, then we…

Dynamical Systems · Mathematics 2007-07-11 Marcus Pivato

Abelian cellular automata (CA) are CA which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images weak *-converge…

Dynamical Systems · Mathematics 2018-02-13 Benjamin Hellouin de Menibus , Ville Salo , Guillaume Theyssier

If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

Let $(\az,F)$ be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the $\N\times\Z$-action of $F$ and the shift map $\s$ to be the Haar measure on $\gs$, a closed…

Dynamical Systems · Mathematics 2007-05-23 Mathieu Sablik

A `right-sided, nearest neighbour cellular automaton' (RNNCA) is a continuous transformation F:A^Z-->A^Z determined by a local rule f:A^{0,1}-->A so that, for any a in A^Z and any z in Z, F(a)_z = f(a_{z},a_{z+1}) . We say that F is…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

Revisiting the notion of m-almost equicontinuous cellular automata introduced by R. Gilman, we show that the sequence of image measures of a shift ergodic measure m by iterations of a m-almost equicontinuous automata F, converges in Cesaro…

Dynamical Systems · Mathematics 2012-07-03 Pierre Tisseur

We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which…

Formal Languages and Automata Theory · Computer Science 2023-09-06 Eric Rowland , Reem Yassawi

A notion of admissible probability measures $\mu$ on a locally compact Abelian group (LCA-group) $G$ with connected dual group $\hat G=\R^d\times \T^n$ is defined. To such a measure $\mu$, a closed semigroup $\Lambda(\mu)\subseteq…

Probability · Mathematics 2007-05-23 S. Albeverio , H. Gottschalk , J. -L. Wu

We add small random perturbations to a cellular automaton and consider the one-parameter family $(F_\epsilon)_{\epsilon>0}$ parameterized by $\epsilon$ where $\epsilon>0$ is the level of noise. The objective of the article is to study the…

Dynamical Systems · Mathematics 2024-12-11 Hugo Marsan , Mathieu Sablik

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)…

Statistical Mechanics · Physics 2015-03-17 J. Ricardo G. Mendonça

For the action of an algebraic cellular automaton on a Markov subgroup, we show that the Ces\`{a}ro mean of the iterates of a Markov measure converges to the Haar measure. This is proven by using the combinatorics of the binomial…

Dynamical Systems · Mathematics 2007-05-23 Alejandro Maass , Servet Mart\'{ı}nez , Marcus Pivato , Reem Yassawi

In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…

Dynamical Systems · Mathematics 2020-05-05 Hasan Akin

We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…

Dynamical Systems · Mathematics 2017-02-21 Martin Delacourt , Benjamin Hellouin de Menibus

The concept of $\mu-$equicontinuity was introduced by Gilman to classify cellular automata. We show that under some conditions the sequence of Cesaro averages of a measure $\mu,$ converge under the actions of a $\mu -$equicontinuous CA. We…

Dynamical Systems · Mathematics 2016-09-02 Felipe García-Ramos

Extending to all probability measures the notion of m-equicontinuous cellular automata introduced for Bernoulli measures by Gilman, we show that the entropy is null if m is an invariant measure and that the sequence of image measures of a…

Dynamical Systems · Mathematics 2012-06-28 Pierre Tisseur

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…

Group Theory · Mathematics 2017-01-24 Alonso Castillo-Ramirez , Maximilien Gadouleau

Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA) over $A^G$ is a function $\tau : A^G \to A^G$ defined via a finite memory set $S \subseteq G$ and a local function $\mu :A^S \to A$. The…

Group Theory · Mathematics 2023-10-10 A. Castillo-Ramirez , M. Sanchez-Alvarez , A. Vazquez-Aceves , A. Zaldivar-Corichi
‹ Prev 1 2 3 10 Next ›