Invertible Linear Cellular Automata over Zm: Algorithmic and Dynamical Aspects

Journal of Computer and System Sciences

Volumn 56, Issue 1, 1998, Pages 60-67

  Manzini, Giovanni ^a   Margara, Luciano ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; TOPOLOGY;

CELLULAR AUTOMATA (CA);

AUTOMATA THEORY;

EID: 0031990385     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1535     Document Type: Article

References (22)

1. S. Amoroso and Y. N. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures, J. Comput. System Sci. 6 (1972), 448-464.
2. H. Aso and N. Honda, Dynamical characteristics of linear cellular automata, J. Comput. System Sci. 30 (1985), 291-317.
3. F. Blanchard, P. Kurka, and A. Maass, Topological and measuretheoretic properties of one-dimensional cellular automata, Physica D 103 (1997), 86-99.
4. m, in "14th Annual Symposium on Theoretical Aspects of Computer Science (STACS '97)," Lect. Notes in Comput. Sci., Vol. 1200, pp. 427-438, Springer-Verlag, New York/ Berlin, 1997.
5. P. Favati, G. Lotti, and L. Margara, One dimensional additive cellular automata are chaotic according to Devaney's definition of chaos, Theor. Comput. Sci. 174 (1997), 157-170.
6. M. Finelli, G. Manzini, and L. Margara, Lyupanov exponents vs expansivity and sensitivity in cellular automata, Journal of Complexity, to appear. A preliminary version is available in "Proc. 2nd Conference on Cellular Automata for Research and Industry (ACRI'96)" (S. Bandini and G. Mauri, Eds.), Springer-Verlag, New York/Berlin, 1996.
7. M. Garzon, "Models of Massive Parallelism," EATCS Texts in Theoretical Computer Science, Springer-Verlag, New York/Berlin, 1995.
8. P. Guan and Y. He, Exact results for deterministic cellular automata with additive rules, J. Statist. Phys. 43 (1986), 463-478.
9. G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Math. Syst. Theor. 3 (1969), 320-375.
10. m, J. Comput. System Sci. 27 (1983), 125-140.
11. J. Kari, Reversability of 2D cellular automata is undecidable, Physica D 45 (1990), 379-385.
12. J. Kari, Reversibility and surjectivity problems of cellular automata, J. Comput. System Sci. 48 (1) (1994), 149-182.
13. A. K. Lenstra and H. W. Lenstra, Algorithms in number theory, in "Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity" (J. van Leeuwen, Ed.), MIT Press/Elsevier, Cambridge/Amsterdam, 1990.
14. D. A. Lind and B. Marcus, "Symbolic Dynamics and Coding," Cambridge Univ. Press, Cambridge, 1996.
15. m, in "24th International Colloquium on Automata Languages and Programming (ICALP'97)," Lect. Notes in Comput. Sci., Springer-Verlag, New York/Berlin, 1997.
16. M. Nasu, Textile systems for endomorphisms and automorphisms of the shift, Memoirs of the Amer. Math. Soc. 114 (1995), 546.
17. D. Richardson, Tessellation with local transformations, J. Comput. System Sci. 6 (1972), 373-388.
18. T. Sato, Decidability for some problems of linear cellular automata over finite commutative rings, Inf. Process. Lett. 46, No. 3 (1993), 151-155.
19. m, J. Comput. Syst. Sci. 49, No. 1 (1994), 18-23.
20. M. A. Shereshevsky, Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms, Indag. Math. N.S. 4 (1993), 203-210.
21. S. Takahashi, Self-similarity of linear cellular automata, J. Comput. System Sci. 44, No. 1 (1992), 114-140.
22. T. Toffoli and H. Margolus, Invertible cellular automata: A review, Physica D 45 (1990), 229-253.