Table of Contents
Regular Contributions
| Faster Methods for Identifying Nontrivial Energy Conservation Functions for Cellular Automata | PostScript PDF |
| Leemon Baird, Barry Fagin | 1-18 |
| 60/102 Null Boundary Cellular Automata based expander graphs | PostScript PDF |
| S.-J. Cho, U.-S. Choi, H.-D. Kim, Y.-H. Hwang, J.-G. Kim | 19-28 |
| Probabilistic initial value problem for cellular automaton rule 172 | PostScript PDF |
| Henryk Fukś | 29-40 |
| Block-sequential update schedules and Boolean automata circuits | PostScript PDF |
| Eric Goles, Mathilde Noual | 41-50 |
| The fractal structure of cellular automata on abelian groups | PostScript PDF |
| Johannes Gütschow, Vincent Nesme, Reinhard F. Werner | 51-70 |
| The Size of One-Way Cellular Automata | PostScript PDF |
| Martin Kutrib, Jonas Lefèvre, Andreas Malcher | 71-90 |
| A weakly universal cellular automaton in the hyperbolic 3D space with three states | PostScript PDF |
| Maurice Margenstern | 91-110 |
| Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs | PostScript PDF |
| Matthias Schulz | 111-124 |
| On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules | PostScript PDF |
| Predrag T. Tošić | 125-144 |
