A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 157-177

  Manzini, Giovanni ^a,b,d   Margara, Luciano ^c  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^b CNR Consiglio Nazionale delle Ricerche   (Italy)

^c UNIVERSITY OF BOLOGNA   (Italy)

^d UNIVERSITY OF TURIN   (Italy)

Author keywords

Discrete time dynamical systems; Linear cellular automata; Topological properties

Indexed keywords

EID: 0004598616     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00031-6     Document Type: Article

References (16)

1. H. Aso, N. Honda, Dynamical characteristics of linear cellular automata, J. Comput. System Sci. 30 (1985) 291-317.
2. m, Theoret. Comput. Sci., to appear.
3. P. Chaudhuri, D. Chowdhury, S. Nandi, S. Chattopadhyay, Additive Cellular Automata Theory and Applications, vol. 1, IEEE Press, New York, 1997.
4. K. Čulik, J. Pachl, S. Yu, On the limit sets of cellular automata, SIAM J. Comput. 18 (1989) 831-842.
5. K. Čulik, S. Yu, Undecidability of CA classification schemes, Complex Systems 2 (1988) 177-190.
6. R. L. Devaney, An Introduction to Chaotic Dynamical Systems, 2nd ed., Addison-Wesley, Reading, MA, USA, 1989.
7. M. Finelli, G. Manzini, L. Margara, Lyapunov exponents vs expansivity and sensitivity in cellular automata, J. Complexity 14 (1998) 210-233.
8. M. Garzon, Models of Massive Parallelism, EATCS Texts in Theoretical Computer Science, Springer, Berlin, 1995.
9. P. Guan, Y. He, Exacts results for deterministic cellular automata with additive rules, J. Statist. Phys. 43 (1986) 463-478.
10. m, J. Comput. System Sci. 27 (1983) 125-140.
11. J. Kari, Rice's theorem for the limit set of cellular automata, Theoret. Comput. Sci. 127 (2) (1994) 229-254.
12. G. Manzini, L. Margara, Attractors of D-dimensional linear cellular automata, 15th Annual Symp. on Theoretical Aspects of Computer Science (STAGS '98), Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, pp. 128-138.
13. m: algorithmic and dynamical aspects, J. Comput. System Sci. 56 (1998) 60-67.
14. m, J. Comput. System Sci. 49 (1) (1994)18-23.
15. m, Inform. Process. Lett. 61 (3) (1997)169-172.
16. M. A. Shereshevsky, Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms, Indag. Math. N.S. 4 (1993) 203-210.