相关论文: The Topological Directional Entropy of Z^2-actions…
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…
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,…
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…
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…
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…
In this paper, we investigate some ergodic properties of $Z^{2}$-actions $T_{p,n}$ generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in $Z_{m}$.
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…
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…
To test a possible relation between the topological entropy and the Arnold complexity, and to provide a non trivial example of a rational dynamical zeta function, we introduce a two-parameter family of two-dimensional discrete rational…
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.
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
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…
A digit function is presented which provides the $i$th-digit in base $p$ of any real number $x$. By means of this function, formulated within $\mathcal{B}$-calculus, the local, nonlocal and global dynamical behaviors of cellular automata…
We study the effect of topology variation on the dynamic behavior of a system with local update rules. We implement one-dimensional binary cellular automata on graphs with various topologies by formulating two sets of degree-dependent…
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a Markov-Dyck shift is given. The derivation of this expression is based on a formula in Keller (G. Keller, {\it Circular codes, loop counting,…
We propose a theory for coupling matter fields with discrete geometry on higher-order networks, i.e. cell complexes. The key idea of the approach is to associate to a higher-order network the quantum entropy of its metric. Specifically we…
We present a method for construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that…
In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…
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…
We give an algorithm, based on the $\phi$-expansion of Parry, in order to compute the topological entropy of a class of shift spaces. The idea is the solve an inverse problem for the dynamical systems $\beta x+\alpha \mod1$.The first part…