J. Albert and I. I. Culik, A simple universal cellular automaton and its one-way and totalisting version, Complex Systems, vol.1, pp.1-16, 1987.

I. K. Culik, J. Pachl, and S. Yu, On the limit sets of cellular automata, SIAM J. Computing, vol.18, pp.831-842, 1989.

J. Kari, The nilpotency problem of one-dimensional cellular automata, SIAM J. Computing, vol.21, pp.571-586, 1992.

B. Martin, A universal cellular automaton in quasi-linear time and its s-m-n form, Theoretical Computer Science, vol.123, issue.2, pp.199-237, 1994.
DOI : 10.1016/0304-3975(92)00076-4
URL : https://doi.org/10.1016/0304-3975(92)00076-4

E. F. Moore, Sequential machines, selected p apers, pp.213-214, 1964.

J. Mazoyer and N. Reimen, A l i n e ar speed-up theorem for cellular automata, Theoretical Computer Science, vol.101, pp.59-98, 1992.

I. A. Smith, Simple computation-universal cellular spaces, Journal ACM, vol.18, pp.339-353, 1971.
DOI : 10.1145/321650.321652

W. S. , Universality and complexity in cellular automata, P h ysica D, vol.10, pp.1-35, 1984.