1. Gilman, R.H.: Classes of linear automata. Erg. Th. & Dyn. Sys. 7, 105–118 (1988)
2. Hurley, M.: Attractors in cellular automata. Erg. Th. & Dyn. Sys. 10, 131–140 (1990)
3. Dubacq, J.C., Durand, B., Formenti, E.: Kolmogorov complexity and cellular automata classification. Th. Comp. Sci. 259(1–2), 271–285 (2001)
4. Durand, B., Formenti, E., Varouchas, G.: On undecidability of equicontinuity classification for cellular automata. In: Morvan, M., Rémila, E., (eds.) DMCS’03. Volume AB of DMTCS Proc. Disc. Math. and Th. Comp. Sci. pp. 117–128 (2003)
5. Culik, K., Yu, S.: Undecidability of cellular automata classification schemes. Comp. Sys. 2, 177–190 (1988)