The surjectivity problem for 2D cellular automata
From MaRDI portal
Publication:1342866
Cites work
- scientific article; zbMATH DE number 522866 (Why is no real title available?)
- scientific article; zbMATH DE number 3205673 (Why is no real title available?)
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Invertible cellular automata: A review
- On the Limit Sets of Cellular Automata
- One-way cellular automata on Cayley graphs
- Reversibility and surjectivity problems of cellular automata
- Reversibility of 2D cellular automata is undecidable
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Tesselations with local transformations
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(8)- Decidability and undecidability in cellular automata
- Embeddings of dynamical systems into cellular automata
- A new dimension sensitive property for cellular automata
- A Random NP-complete problem for inversion of 2D cellular automata
- Snakes and cellular automata: reductions and inseparability results
- Tilings: recursivity and regularity
- Inversion of 2D cellular automata: Some complexity results
- Number-conserving cellular automata I: Decidability.
This page was built for publication: The surjectivity problem for 2D cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342866)
