English
Related papers

Related papers: Asymptotic Randomization of Sofic Shifts by Linear…

200 papers

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

Group Theory · Mathematics 2023-01-27 Alonso Castillo-Ramirez , O. Mata-Gutiérrez , Angel Zaldivar-Corichi

Consider the cellular automata (CA) of $\mathbb{Z}^{2}$-action $\Phi$ on the space of all doubly infinite sequences with values in a finite set $\mathbb{Z}_{r}$, $r \geq 2$ determined by cellular automata $T_{F[-k, k]}$ with an additive…

Dynamical Systems · Mathematics 2017-12-27 Hasan Akin

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

Dynamical Systems · Mathematics 2020-06-30 Michael Björklund , Yair Hartman , Hanna Oppelmayer

In this chapter, we investigate directional entropy for semigroup actions generated by one-dimensional linear cellular automata (LCAs) and the shift transformation on the compact metric space $\mathbb{Z}_m^{\mathbb{N}}$. This work provides…

Dynamical Systems · Mathematics 2025-05-16 Hasan Akin

We investigate the conditions under which the mean-field formulation of a probabilistic, totalistic cellular automaton approximates the logistic equation. We show that this goal can be only fulfilled for an infinite-range neighborhood. We…

Cellular Automata and Lattice Gases · Physics 2026-03-06 Franco Bagnoli

We will consider a family of cellular automata $\Phi: \{1,2,...,r\}^\mathbb{N}\circlearrowright$ that are not of algebraic type. Our first goal is to determine conditions that result in the identification of probabilities that are at the…

Dynamical Systems · Mathematics 2024-07-08 Artur O. Lopes , Elismar R. Oliveira , Marcelo Sobottka

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…

Dynamical Systems · Mathematics 2018-06-05 Benjamin Hellouin de Menibus , Mathieu Sablik

Starting with a unit-preserving normal completely positive map L: M --> M acting on a von Neumann algebra - or more generally a dual operator system - we show that there is a unique reversible system \alpha: N --> N (i.e., a complete order…

Operator Algebras · Mathematics 2007-05-23 William Arveson

Let $X=S^G$ where $G$ is a countable group and $S$ is a finite set. A cellular automaton (CA) is an endomorphism $T : X \to X$ (continuous, commuting with the action of $G$). Shereshevsky (1993) proved that for $G=Z^d$ with $d>1$ no CA can…

Dynamical Systems · Mathematics 2007-06-13 Tom Meyerovitch

We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with…

Statistical Mechanics · Physics 2017-05-24 J. Ricardo G. Mendonça , Yeva Gevorgyan

Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…

Discrete Mathematics · Computer Science 2015-03-18 Pablo Arrighi , Renan Fargetton , Vincent Nesme , Eric Thierry

In this paper we study the measure-theoretical entropy of the one-dimensional linear cellular automata (CA hereafter) $T_{f[-l,r]}$, generated by local rule $f(x_{-l},...,x_{r})= \sum\limits_{i=-l}^{r}\lambda_{i}x_{i}(\text{mod}\ m)$, where…

Dynamical Systems · Mathematics 2007-05-23 Hasan Akin

Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…

Dynamical Systems · Mathematics 2019-04-30 Rezki Chemlal

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

We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic…

Formal Languages and Automata Theory · Computer Science 2022-09-28 Ville Salo

Let $\Cal S$ be an abelian group of automorphisms of a probability space $(X, {\Cal A}, \mu)$ with a finite system of generators $(A_1, ..., A_d)$. Let $A^{\el}$ denote $A_1^{\ell_1} ... A_d^{\ell_d}$, for ${\el}= (\ell_1, ..., \ell_d)$. If…

Probability · Mathematics 2014-11-14 Jean-Pierre Conze , Guy Cohen

We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a…

Dynamical Systems · Mathematics 2021-08-31 Ilkka Törmä

Let $G$ be a group and let $V$ be an algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $V$. We introduce algebraic sofic subshifts $\Sigma \subset A^G$ and study endomorphisms $\tau \colon…

Dynamical Systems · Mathematics 2024-11-20 Tullio Ceccherini-Silberstein , Michel Coornaert , Xuan Kien Phung

We study the sofic tree shifts of $A^{\Sigma^*}$, where $\Sigma^*$ is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if $X \subset A^{\Sigma^*}$ is a…

Formal Languages and Automata Theory · Computer Science 2014-02-11 Tullio Ceccherini-Silberstein , Michel Coornaert , Francesca Fiorenzi , Zoran Sunic

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…

Dynamical Systems · Mathematics 2007-05-23 Siddhartha Bhattacharya