Limit sets of stable cellular automata
From MaRDI portal
Publication:5262237
DOI10.1017/etds.2013.72zbMath1355.37025arXiv1301.3790OpenAlexW3101493161MaRDI QIDQ5262237
Publication date: 13 July 2015
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.3790
Related Items
Inferring the Limit Behavior of Some Elementary Cellular Automata, On semi-open codes and bi-continuing almost everywhere codes
Cites Work
- Weak equivalence for shifts of finite type
- Sofic systems and graphs
- Lifting covers of sofic shifts
- Decompositions of finite-to-one factor maps
- On the existence of open and bi-continuing codes
- Core dimension group constraints for factors of sofic shifts
- Shift equivalence and the Jordan form away from zero
- Sofic systems and encoding data
- Resolving factor maps for shifts of finite type with equal entropy
- On the sofic limit sets of cellular automata
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
- Putnam's resolving maps in dimension zero