Inversion of 2D cellular automata: Some complexity results
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 21231 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 522847 (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
- 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 complexity of theorem-proving procedures
- The surjectivity problem for 2D cellular automata
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(19)- Predecessor existence problems for finite discrete dynamical systems
- A two-layer representation of four-state reversible number-conserving 2D cellular automata
- Some applications of propositional logic to cellular automata
- Theory of cellular automata: a survey
- A new dimension sensitive property for cellular automata
- On the structure of the set of reversible cellular automata
- Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries
- Structure and reversibility of 2D hexagonal cellular automata
- 2D Triangular von Neumann Cellular Automata with Periodic Boundary
- Complexity of reachability problems for finite discrete dynamical systems
- Tilings: recursivity and regularity
- Structure and reversibility of 2D von Neumann cellular automata over triangular lattice
- Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
- Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
- Efficient enumeration of three-state two-dimensional number-conserving cellular automata
- 2D linear CA with mixing boundary conditions and reversibility
- Irreversibility of 2D linear CA and Garden of Eden
- Garden of Eden configurations for 2-D cellular automata with rule 2460 N
- A Random NP-complete problem for inversion of 2D cellular automata
This page was built for publication: Inversion of 2D cellular automata: Some complexity results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341722)
