Universality of Reversible Hexagonal Cellular Automata
From MaRDI portal
Publication:4953340
DOI10.1051/ITA:1999131zbMATH Open0953.68099OpenAlexW2152053768MaRDI QIDQ4953340FDOQ4953340
Authors: Katsunobu Imai, Kenichi Morita, M. Margenstern 
Publication date: 9 May 2000
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222072
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
Cited In (11)
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- Title not available (Why is that?)
- An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
- 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
- Cellular automaton supercolliders
- Title not available (Why is that?)
- Glider-based computing in reaction-diffusion hexagonal cellular automata
- Structure and reversibility of 2D von Neumann cellular automata over triangular lattice
- A survey of cellular automata: types, dynamics, non-uniformity and applications
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)
