How common can be universality for cellular automata?
From MaRDI portal
Recommendations
Cited in
(13)- The mirage of universality in cellular automata
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
- Unraveling simplicity in elementary cellular automata
- Color blind cellular automata
- On the behavior characteristics of cellular automata
- On factor universality in symbolic spaces
- The intrinsic universality problem of one-dimensional cellular automata
- Intrinsically universal cellular automata
- Captive cellular automata
- On local symmetries and universality in cellular automata
- Bulking II: Classifications of cellular automata
- Do integrable cellular automata have the confinement property?
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality
This page was built for publication: How common can be universality for cellular automata?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710668)