On computing the entropy of cellular automata.
From MaRDI portal
Recommendations
Cites work
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Attractors of linear cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Endomorphisms and automorphisms of the shift dynamical system
- Entropy bounds for endomorphisms commuting with \(k\) actions
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Languages, equicontinuity and attractors in cellular automata
- Linear cellular automata over \(Z_ m\)
- Lyapunov exponents for one-dimensional cellular automata
- Reversibility and surjectivity problems of cellular automata
- Textile systems for endomorphisms and automorphisms of the shift
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The topological entropy of cellular automata is uncomputable
- Topological and measure-theoretic properties of one-dimensional cellular automata
Cited in
(45)- On the topological directional entropy
- Additive cellular automata and volume growth
- Decidability and undecidability in cellular automata
- A class of discrete dynamical systems with properties of both cellular automata and L-systems
- An upper bound of the directional entropy with respect to the Markov measures
- Upper bound of the directional entropy of a \(\mathbb Z^2\)-action
- scientific article; zbMATH DE number 4100614 (Why is no real title available?)
- Embeddings of dynamical systems into cellular automata
- Dynamical behavior of additive cellular automata over finite abelian groups
- Entropy of additive cellular automata
- The topological entropy of invertible cellular automata
- Minimal entropy approximation for cellular automata
- The entropy and reversibility of cellular automata on Cayley tree
- On computing the Lyapunov exponents of reversible cellular automata
- The topological entropy of \(n\)th iteration of an additive cellular automata
- The measure-theoretic entropy and topological entropy of actions over \(\mathbb{Z}_m\)
- The algebraic entropy of one-dimensional finitary linear cellular automata
- On the directional dynamics of additive cellular automata
- On cellular automata over Galois rings
- The topological entropy of cellular automata is uncomputable
- Estimation of topological entropy for cocycles with cellular automaton as a base system
- Apparent entropy of cellular automata
- BUILDING EFFICIENT COMPUTATIONAL CELLULAR AUTOMATA MODELS OF COMPLEX SYSTEMS: BACKGROUND, APPLICATIONS, RESULTS, SOFTWARE, AND PATHOLOGIES
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Directional metric entropy and Lyapunov exponents for dynamical systems generated by cellular automata
- Finite entropy for multidimensional cellular automata
- On computing the topological entropy of one-sided cellular automata
- Row subshifts and topological entropy of cellular automato
- Topology-induced phase transitions in totalistic cellular automata
- Densities and entropies in cellular automata
- Rescaled entropy of cellular automata
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Chaos of elementary cellular automata rule 42 of Wolfram’s class II
- The degree function for cellular dynamics
- The topological entropy of iterated piecewise affine maps is uncomputable
- On the measure entropy of additive cellular automata \(f_\infty\)
- On the computability of the topological entropy of subshifts
- Effect of quantified irreducibility on the computability of subshift entropy
- Expressing the entropy of lattice systems as sums of conditional entropies
- On the directional entropy of \(\mathbb Z^2\)-actions generated by additive cellular automata
- Entropy of multidimensional cellular automata
- Dynamics and topological entropy of 1D Greenberg-Hastings cellular automata
- Surjective cellular automata with zero entropy are almost one-to-one
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Arithmetic representations of cellular automata
This page was built for publication: On computing the entropy of cellular automata.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401183)
