Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1997: Mathematical Foundations of Computer Science 1997 pp 378–387Cite as

Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects

  • Contributed Papers
  • Conference paper
  • First Online:

  • 109 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1295))

Abstract

We give an explicit and efficiently computable formula for the inverse of D-dimensional linear cellular automata over Zm (D ≥ 1, m ≥ 2). We use this formula to get an easy-to-check necessary and sufficient condition for an invertible 1-dimensional linear CA to be expansive.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Amoroso and Y. N. Patt. Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. Journal of Computer and System Sciences, 6:448–464, 1972.

    Google Scholar 

  2. H. Aso and N. Honda. Dynamical characteristics of linear cellular automata. Journal of Computer and System Sciences, 30:291–317, 1985.

    Article  Google Scholar 

  3. G. Cattaneo, E. Formenti, G. Manzini, and L. Margara. On ergodic linear cellular automata over Z m In 14th Annual Symposium on Theoretical Aspects of Computer Science (STAGS '97), volume 1200 of LNCS, pages 427–438. Springer Verlag, 1997.

    Google Scholar 

  4. P. Favati, G. Lotti, and L. Margara. One dimensional additive cellular automata are chaotic according to Devaney's definition of chaos. Theoretical Computer Science, 174:157–170, 1997.

    Article  Google Scholar 

  5. P. Guan and Y. He. Exacts results for deterministic cellular automata with additive rules. Jour. Stat. Physics, 43:463–478, 1986.

    Article  Google Scholar 

  6. M. Ito, N. Osato, and M. Nasu. Linear cellular automata over Z m Journal of Computer and System Sciences, 27:125–140, 1983.

    Article  Google Scholar 

  7. J. Kari. Reversability of 2D cellular automata is undecidable. Physica, D 45:379–385, 1990.

    Google Scholar 

  8. J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48(1):149–182, 1994.

    Article  Google Scholar 

  9. G. Manzini and L. Margara. A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m Technical Report B4-96-18, Istituto di Matematica Computazionale, CNR, Pisa, Italy, 1996.

    Google Scholar 

  10. D. Richardson. Tessellation with local transformations. Journal of Computer and System Sciences, 6:373–388, 1972.

    Google Scholar 

  11. T. Sato. Decidability for some problems of linear cellular automata over finite commutative rings. Information Processing Letters, 46(3):151–155, 1993.

    Article  Google Scholar 

  12. T. Sato. Group structured linear cellular automata over Z m. Journal of Computer and System Sciences, 49(1):18–23, 1994.

    Article  Google Scholar 

  13. M. A. Shereshevsky. Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms. Indag. Mathem. N.S., 4:203–210, 1993.

    Article  Google Scholar 

  14. T. Toffoli and H. Margolus. Invertible cellular automata: A review. Physica, D 45:229–253, 1990.

    Google Scholar 

  15. J. van Leeuwen (Managing Editor). Handbook of Theoretical Computer Science. Volume A: Algorithms and complexity. The MIT press/Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze e Tecnologie Avanzate, Università di Torino, Via Cavour 84, 15100, Alessandria, Italy

    Giovanni Manzini

  2. Istituto di Matematica Computazionale, Via S. Maria, 46, 56126, Pisa, Italy

    Giovanni Manzini

  3. Dipartimento di Scienze dell'Informazione, Università di Bologna, Mura Anteo Zamboni 7, 40127, Bologna, Italy

    Luciano Margara

Authors
  1. Giovanni Manzini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luciano Margara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manzini, G., Margara, L. (1997). Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029981

Download citation

  • DOI: https://doi.org/10.1007/BFb0029981

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63437-9

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation