Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes
From MaRDI portal
Publication:549697
DOI10.1016/j.tcs.2011.02.020zbMath1230.37022OpenAlexW1966476094MaRDI QIDQ549697
Publication date: 18 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.020
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results about the chaotic behavior of cellular automata
- A Curtis-Hedlund-Lyndon theorem for Besicovitch and Weyl spaces
- On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
- Amenable groups and cellular automata
- Cellular automata and strongly irreducible shifts of finite type.
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- On Pattern Density and Sliding Block Code Behavior for the Besicovitch and Weyl Pseudo-distances
- Multidimensional cellular automata and generalization of Fekete's lemma
- Surjunctivity for cellular automata in Besicovitch spaces
- An Introduction to Symbolic Dynamics and Coding
- Folner's Conditions for Amenable Semi-Groups.
This page was built for publication: Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes