Snakes and Cellular Automata: Reductions and Inseparability Results
From MaRDI portal
Publication:3007629
DOI10.1007/978-3-642-20712-9_17zbMath1332.68155WikidataQ62045929 ScholiaQ62045929MaRDI QIDQ3007629
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_17
68Q80: Cellular automata (computational aspects)
Related Items
Cites Work
- Reversibility of 2D cellular automata is undecidable
- Reversibility and surjectivity problems of cellular automata
- On the solvability of domino snake problems
- The surjectivity problem for 2D cellular automata
- Theory of cellular automata: a survey
- The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system
- The undecidability of the domino problem
- Unnamed Item
- Unnamed Item
- Unnamed Item