Universality of Reversible Hexagonal Cellular Automata
From MaRDI portal
Publication:4953340
Recommendations
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Simple universal one-dimensional reversible cellular automata
- Developments in Language Theory
- Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries
Cites work
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Computation and construction universality of reversible cellular automata
- Conservative logic
- Invertible cellular automata: A review
- Logical Reversibility of Computation
Cited in
(11)- Reversibility algorithms for 3-state hexagonal cellular automata with periodic boundaries
- scientific article; zbMATH DE number 7384890 (Why is no real title available?)
- Structure and reversibility of 2D hexagonal cellular automata
- scientific article; zbMATH DE number 1775519 (Why is no real title available?)
- Structure and reversibility of 2D von Neumann cellular automata over triangular lattice
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Glider-based computing in reaction-diffusion hexagonal cellular automata
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
- 2D Triangular von Neumann Cellular Automata with Periodic Boundary
- Cellular automaton supercolliders
This page was built for publication: Universality of Reversible Hexagonal Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953340)
