Linear algebra based bounds for one-dimensional cellular automata
From MaRDI portal
Recommendations
- Bounds on Non-surjective Cellular Automata
- On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
- On the inverse neighbourhoods of reversible cellular automata
- On reversibility of cellular automata with periodic boundary conditions
- A tight linear bound on the neighborhood of inverse cellular automata
Cites work
- A tight linear bound on the neighborhood of inverse cellular automata
- Bounds on Non-surjective Cellular Automata
- Endomorphisms and automorphisms of the shift dynamical system
- scientific article; zbMATH DE number 21231 (Why is no real title available?)
- scientific article; zbMATH DE number 3205673 (Why is no real title available?)
- Reversibility and surjectivity problems of cellular automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Theory of cellular automata: a survey
Cited in
(4)
This page was built for publication: Linear algebra based bounds for one-dimensional cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200076)