Cellular automata reversible over limit set
From MaRDI portal
Publication:5446409
zbMATH Open1136.68438MaRDI QIDQ5446409FDOQ5446409
Authors: Siamak Taati 
Publication date: 6 March 2008
Recommendations
- On the structure of the set of reversible cellular automata
- Reversibility of 2D cellular automata is undecidable
- Generalized reversibility of topological dynamical systems and cellular automata
- On reversibility of cellular automata with periodic boundary conditions
- Theory of cellular automata: a survey
Cited In (6)
- Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata
- On dynamical complexity of surjective ultimately right-expansive cellular automata
- The complexity of reversible cellular automata
- Arithmetical complexity of the language of generic limit sets of cellular automata
- On time-symmetry in cellular automata
- Category theory of symbolic dynamics
This page was built for publication: Cellular automata reversible over limit set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446409)
