Abstract is missing.
- Faster Methods for Identifying Nontrivial Energy Conservation Functions for Cellular AutomataLeemon Baird, Barry Fagin. 1-18 [doi]
- 60/102 Null Boundary Cellular Automata based expander graphsS.-J. Cho, U.-S. Choi, H. D. Kim, Y.-H. Hwang, J. G. Kim. 19-28 [doi]
- Probabilistic initial value problem for cellular automaton rule 172Henryk Fuks. 29-40 [doi]
- Block-sequential update schedules and Boolean automata circuitsEric Goles Ch., Mathilde Noual. 41-50 [doi]
- The fractal structure of cellular automata on abelian groupsJohannes Gütschow, Vincent Nesme, Reinhard F. Werner. 51-70 [doi]
- The Size of One-Way Cellular AutomataMartin Kutrib, Jonas Lefèvre, Andreas Malcher. 71-90 [doi]
- A weakly universal cellular automaton in the hyperbolic 3D space with three statesMaurice Margenstern. 91-110 [doi]
- Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic GraphsMatthias Schulz. 111-124 [doi]
- On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rulesPredrag T. Tosic. 125-144 [doi]