English
Related papers

Related papers: On Directional Entropy of a $\mathbb{Z}^{2}$-Actio…

200 papers

In this paper we study the topological and metric directional entropy of $\mathbb{Z}^2$-actions by generated additive cellular automata (CA hereafter), defined by a local rule $f[l, r]$, $l, r\in \mathbb{Z}$, $l\leq r$, i.e. the maps…

Dynamical Systems · Mathematics 2015-05-11 Hasan Akin

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

In this short paper, we compute the directional sequence entropy for of $\mathbb{Z}_+\times \mathbb{Z}$-actions generated by cellular automata and the shift map. Meanwhile, we study the directional dynamics of this system. As a corollary,…

Dynamical Systems · Mathematics 2022-04-14 Hasan Akın , Chunlin Liu

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

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

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…

Discrete Mathematics · Computer Science 2010-08-23 Martin Delacourt , Victor Poupet , Mathieu Sablik , Guillaume Theyssier

We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the…

Dynamical Systems · Mathematics 2012-06-29 François Blanchard , Pierre Tisseur

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

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

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

Following work by Hochman and Meyerovitch on multidimensional SFT, we give computability-theoretic characterizations of the real numbers that can appear as the topological entropies of one-dimensional and two-dimensional cellular automata.

Computational Complexity · Computer Science 2012-04-05 Pierre Guillon , Charalampos Zinoviadis

In this paper, entropies, including measure-theoretic entropy and topological entropy, are considered for random $\mathbb{Z}^k$-actions which are generated by random compositions of the generators of $\mathbb{Z}^k$-actions. Applying Pesin's…

Dynamical Systems · Mathematics 2017-01-04 Yujun Zhu

Given a new definition for the entropy of a cellular automata acting on a two-dimensional space, we propose an inequality between the entropy of the shift on a two-dimensional lattice and some angular analog of Lyapunov exponents.

Dynamical Systems · Mathematics 2007-05-23 Pierre Tisseur

Cellular automata (CA) exemplify systems where simple local interaction rules can lead to intricate and complex emergent phenomena at large scales. The various types of dynamical behavior of CA are usually categorized empirically into…

Cellular Automata and Lattice Gases · Physics 2024-06-10 Wout Merbis , Calvin Bakker

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

We study the directional entropy of the dynamical system associated to a $\Z^2$ configuration in a finite alphabet. We show that under local assumptions on the complexity, either every direction has zero topological entropy or some…

Dynamical Systems · Mathematics 2014-09-18 Ryan Broderick , Van Cyr , Bryna Kra

Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift.

Dynamical Systems · Mathematics 2012-07-12 Pierre Tisseur

We show that the thermodynamic entropy density is proportional to the largest Lyapunov ex- ponent (LLE) of a discrete hydrodynamical system, a deterministic two-dimensional lattice gas automaton. The definition of the LLE for cellular…

Statistical Mechanics · Physics 2010-06-15 Franco Bagnoli , Raul Rechtman

In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…

Cellular Automata and Lattice Gases · Physics 2007-07-06 Xu Xu , Yi Song , Stephen P. Banks

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
‹ Prev 1 2 3 10 Next ›