1. Albert J. and Culik II K. A simple universal cellular automaton and its one-way totalistic version. Complex Systems. Vol. no. 1: 1–16, 1987.
2. Allouche J.-P., v. Haeseler F., Peitgen H.-O. and Skordev G. Linear cellular automata, finite automata and Pascal’s triangle. Discrete App!. Math. Vol. no. 66: 1–22, 1996.
3. Allouche J.-P., v. Haeseler F., Peitgen H.-O., Petersen A. and Skordev G. Automaticity of double sequences generated by one-dimensional cellular automata. To appear in Theoretical Computer Science.
4. Aso H. and Honda N. Dynamical Characteristics of Linear Cellular Automata. Journal of Computer and System Sciences. Vol. no. 30: 291–317: 1985.
5. Banks E. R. Universality in Cellular Automata. I.E.E.E. Ann. Symp. Switching and Automata Theory. Santa Monica, Vol. no. 11: 194–215, 1970.