Additive Cellular Automata and Volume Growth

title={Additive Cellular Automata and Volume Growth},
author={Thomas Ward},
journal={Entropy},
year={2000},
volume={2},
pages={142-167}
}
• T. Ward
• Published 2000
• Mathematics
• Entropy
A class of dynamical systems associated to rings of S-integers in rational function fields is described. General results about these systems give a rather complete description of the well-known dynamics in one-dimensional additive cellular automata with prime alphabet, including simple formulae for the topological entropy and the number of periodic configurations. For these systems the periodic points are uniformly distributed along some subsequence with respect to the maximal measure, and in…

Figures from this paper

The Complexity of Permutive Cellular Automata
• Mathematics
J. Cell. Autom.
• 2011
This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are
Some Properties of topological pressure on cellular automata
This paper investigates the ergodicity and the power rule of the topological pressure of a cellular automaton. If a cellular automaton is either leftmost or rightmost premutive (due to the
On the Measure Entropy of Additive Cellular Automata f∞
• H. Akın
• Computer Science, Mathematics
Entropy
• 2003
The measure-theoretic entropy of the additive one-dimensional cellular automata f∞ with respect to μ is equal to hμ (f∞) = 2klog r, where k ≥ 1, r-1∈S.
The Topological Pressure of Linear Cellular Automata
• Mathematics
Entropy
• 2009
This elucidation studies ergodicity and equilibrium measures for additive cellular automata with prime states and concludes that Parry measure is inferred to be an equilibrium measure.
Mean dimension of continuous cellular automata
• Mathematics
• 2021
We investigate the mean dimension of a cellular automaton (CA for short) with a compact non-discrete space of states. A formula for the mean dimension is established for (near) strongly permutative,
Stream cipher using two dimensional Cellular Automata
• Computer Science
• 2015
The pseudo-random early in cryptography systems, the important of cellular automata has properties which are considered a state machine, high periods, the binary sequences that are generated form CA generator are characterized by their success in random tests.
• Computer Science
• 2007
An analytical framework is developed to characterize the cyclic vector subspaces gene rat d by anACA with reference toLCA and provides the theoretical analysis of the nature of d ifference.
On cellular automata over Galois rings
• Mathematics
Inf. Process. Lett.
• 2007
2 4 Ja n 20 06 Measure rigidity for algebraic bipermutative cellular automata
Let (A Z , F) be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the N × Z-action of F and the shift map σ to be the Haar

References

SHOWING 1-10 OF 36 REFERENCES
S-integer dynamical systems: periodic points.
• Mathematics
• 1997
We associate via duality a dynamical system to each pair (RS,x), where RS is the ring of S-integers in an A-field k, and x is an element of RS\{0}. These dynamical systems include the circle doubling
Statistical mechanics of cellular automata
Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.
Almost all $S$-integer dynamical systems have many periodic points
• T. Ward
• Mathematics
Ergodic Theory and Dynamical Systems
• 1998
We show that for almost every ergodic $S$-integer dynamical system the radius of convergence of the dynamical zeta function is no larger than $\exp(-\frac{1}{2}h_{\rm top})<1$. In the arithmetic case
The topological entropy of cellular automata is uncomputable
• Computer Science
Ergodic Theory and Dynamical Systems
• 1992
A set of aperiodic Wang tiles arising from Penrose's kite and dart tiles is used to demonstrate specific examples of cellular automata with a single periodic point but non-trivial non-wandering sets, which furthermore can be constructed to have arbitrarily high topological entropy.
Introduction to Chaotic Dynamical Systems
This thesis develops some of the current definitions of chaos and discusses several quantitative measures of chaos, and serves as a complement to the work done by Philip Beaver, which details chaotic dynamics for discrete systems.
On Ergodic Linear Cellular Automata over Zm
• Mathematics, Computer Science
STACS
• 1997
It is proven that, for general cellular automata, ergodicity is equivalent to topological chaos (transitivity and sensitivity to initial conditions) and it is proved that linear CA over Zp with p prime have dense periodic orbits.
On Computing the Entropy of Cellular Automata
• Computer Science
ICALP
• 1998
A closed formula is proved for the topological entropy of D-dimensional (D >1) linear cellular automata over the ring Z m (m ≥ 2) and an algorithm is provided for computing the topology entropy of positively expansive Cellular automata.