On invertible and stably reversible non-uniform cellular automata
From MaRDI portal
Publication:2699949
DOI10.1016/j.tcs.2022.09.011MaRDI QIDQ2699949
Publication date: 20 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.011
68Qxx: Theory of computing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local rule distributions, language complexity and non-uniform cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- A generalization of the Curtis-Hedlund theorem
- Amenable groups and cellular automata
- Endomorphisms of symbolic algebraic varieties
- Sofic groups and direct finiteness.
- Stable finiteness of group rings in arbitrary characteristic
- On linear shifts of finite type and their endomorphisms
- On the Garden of Eden theorem for endomorphisms of symbolic algebraic varieties
- On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups
- Amenability of groups is characterized by Myhill's theorem
- Injective linear cellular automata and sofic groups
- An “almost dual” to Gottschalk’s Conjecture
- On groups with full Banach mean value
- Induction and restriction of cellular automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system
- A geometric generalization of Kaplansky’s direct finiteness conjecture
