Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2000: STACS 2000 pp 110–121Cite as

Linear Cellular Automata with Multiple State Variables

  • Conference paper
  • First Online:

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

Abstract

We investigate a finite state analog of subband coding, based on linear Cellular Automata with multiple state variables. We show that such a CA is injective (surjective) if and only if the determinant of its transition matrix is an injective (surjective, respectively) single variable automaton. We prove that in the one-dimensional case every injective automaton can be factored into a sequence of elementary automata, defined by elementary transition matrices. Finally, we investigate the factoring problem in higher dimensional spaces.

Research supported by NSF Grant CCR 97-33101

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Amoroso and Y. Patt. Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures. Journal of Computer and System Sciences 6 (1972): 448–464.

    MATH  MathSciNet  Google Scholar 

  2. H. Aso and N. Honda. Dynamical Characteristics of Linear Cellular Automata. Journal of Computer and System Sciences 30 (1985), 291–317.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Bruckers and A. van den Enken. New networks for perfect inversion and perfect reconstruction. IEEE J. Select. Areas Commun. 10 (1992), 130–137.

    Google Scholar 

  4. P.M. Cohn. On the structure of the GL2 of a ring. Inst. Hautes Études Sci. Publ. Math. 30 (1966), 365–413.

    Article  MATH  Google Scholar 

  5. K. Culik II. On Invertible Cellular Automata. Complex Systems 1 (1987): 1035–1044.

    MATH  MathSciNet  Google Scholar 

  6. G. Hedlund. Endomorphisms and automorphisms of shift dynamical systems, Mathematical Systems Theory 3 (1969), 320–375.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Ito, N. Osato and M. Nasu. Linear Cellular Automata over ℤm. Journal of Computer and System Sciences 27 (1983), 125–140.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Kari. Representation of reversible cellular automata with block permutations. Mathematical Systems Theory 29, 47–61, 1996.

    MATH  MathSciNet  Google Scholar 

  10. G. Manzini and L. Margara. Invertible Linear Cellular Automata over ℤm: Algorithmic and Dynamical Aspects. Journal of Computer and System Sciences 56 (1998), 60–67.

    Article  MATH  MathSciNet  Google Scholar 

  11. N. McCoy. Rings and Ideals, 1948.

    Google Scholar 

  12. B. McDonald. Finite Rings with Identity, 1974.

    Google Scholar 

  13. E.F. Moore. Machine Models of Self-reproduction. Proc. Sympos. Appl. Math. 14 (1962): 17–33.

    Google Scholar 

  14. J. Myhill. The Converse to Moore’s Garden-of-Eden Theorem. Proc. Amer. Math. Soc. 14 (1963): 685–686.

    Article  MATH  MathSciNet  Google Scholar 

  15. H.A. Park. A Computational Theory of Laurent Polynomial Rings and Multidimensional FIR Systems, Ph.D. thesis, UC Berkeley, 1995.

    Google Scholar 

  16. D. Richardson. Tessellation with local transformations, Journal of Computer and System Sciences 6 (1972), 373–388.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. J.M. Shapiro. Embedded image coding using zerotrees of wavelet coefficients. IEEE Transactions on Signal Processing, Special Issue on Wavelets and Signal Processing 41(12) (1993), 3445–3462.

    MATH  Google Scholar 

  19. A.A. Suslin. On the structure of the special linear group over polynomial rings. Math. USSR Izv. 11 (1977), 221–238.

    Article  MATH  Google Scholar 

  20. T. Toffoli and N. Margolus. Cellular Automata Machines, MIT Press, Cambridge, Massachusetts, 1987.

    Google Scholar 

  21. T. Toffoli and N. Margolus. Invertible Cellular Automata: A Review, Physica D, 45 (1990), 229–253.

    Article  MATH  MathSciNet  Google Scholar 

  22. L. Tolhuizen H. Hollmann and T. Kalker. On the Realizability of Biorthogonal, m-Dimensional Two-Band Filter Banks. IEEE Transactions on Signal Processing 43 (1995), 640–648.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, MLH 14, University of Iowa, IA, 52242, USA

    Jarkko Kari

Authors
  1. Jarkko Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Dept. of Theoretical Computer Science, Universität Dresden, 01062, Dresden, Germany

    Horst Reichel

  2. Université de Lille, LIFL - UPRESA 8022, CNRS, Bât. M3 - UFR IEEA, 59655, Villeneuve d’ASCQ Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kari, J. (2000). Linear Cellular Automata with Multiple State Variables. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-46541-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67141-1

  • Online ISBN: 978-3-540-46541-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation