The following pages link to STACS 2005 (Q5710668):
Displaying 8 items.
- Bulking II: Classifications of cellular automata (Q549701) (← links)
- One-dimensional cellular automata with random rules: longest temporal period of a periodic solution (Q2119677) (← links)
- Unraveling simplicity in elementary cellular automata (Q2628772) (← links)
- Color blind cellular automata (Q2811217) (← links)
- On the behavior characteristics of cellular automata (Q3378862) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311118) (← links)
- Do integrable cellular automata have the confinement property? (Q5757539) (← links)
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)