On computing the Lyapunov exponents of reversible cellular automata
From MaRDI portal
Publication:6095493
DOI10.1007/s11047-020-09821-3zbMath1530.68170MaRDI QIDQ6095493
Publication date: 8 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Universal pattern generation by cellular automata
- Lyapunov exponents for one-dimensional cellular automata
- On computing the entropy of cellular automata.
- Distortion in one-head machines and cellular automata
- Representation by an automaton of continuous functions of the torus
- The Lyapunov exponents of reversible cellular automata are uncomputable
- Densities and Entropies in Cellular Automata
- Non-expansive directions for ℤ2 actions
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The topological entropy of cellular automata is uncomputable
- Cellular automata and Lyapunov exponents
- The spacetime of a shift endomorphism
- Cellular automata and powers of p∕q
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: On computing the Lyapunov exponents of reversible cellular automata