Skip to main content
SpringerLink
Log in

On the Structure of Linear Cellular Automata

  • Conference paper
Book cover Combinatorics, Computability and Logic

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Abstract

We introduce a new class of cellular automata, much richer than the classical one. These one dimensional cellular automata, called here linear, are presented together with their properties in the first section of the paper. We characterize linear functions which are global transition functions for certain bounded linear cellular automata. Finally, some results concerning the limit sets and a remarkable structure for isometric linear cellular automata are also included.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandini, S., Serra, R., Liverani, F.S. (Eds): Cellular Automata: Research Towards Industry. ACRI’98 - Proceedings of the 3rd Conference on Cellular Automata for Research and Industry. Trieste. 7–9 October (1998). Springer

    Google Scholar 

  2. Cattaneo, G., Formenti, E., Margara, L., Mauri, G.: On the dynamical behavior of chaotic cellular automata. Theor. Computer Sci. 217 (1999) 31–51

    Article  MathSciNet  MATH  Google Scholar 

  3. Chopard, B., Droz, M.: Cellular automata modelling of physical systems. Cambridge University Press. Cambridge (1998)

    Book  Google Scholar 

  4. Culik, K., Pachl, J., Yu, S.: On the limit sets of cellular automata. SIAM J. Comput. 18 (1989) 831–842

    MathSciNet  MATH  Google Scholar 

  5. Duff, M.J.B., Fountain, T.J.: Cellular Logic Image Processing. Academic Press (1986)

    Google Scholar 

  6. Durand, B., Mazoyer, J.: Growing Patterns in 1D Cellular Automata. Lecture Notes in Computer Science. (1994) 211–220

    Google Scholar 

  7. Hurd, L.P.: Formal language characterizations of cellular automata limit sets. Complex Systems. 1 (1987) 69–80

    MathSciNet  MATH  Google Scholar 

  8. von Neumann, J.: Theory of self-reproducing automata. Illinois University Press. Illinois. Edited and completed by A.W. Burks (1966)

    Google Scholar 

  9. Popovici, A., Popovici, D.: Cellular automata and ö—uniform BSS-machines. Proc. Intern. Conf. on Symm and Antisymm. in Mathematics, Formal Languages and Computer Science. Bra§ov. June 29—July 1. (2000) 289–296

    Google Scholar 

  10. PP2] Popovici, A., Popovici, D.: Codes and Classes of Cellular Automata. To appear.

    Google Scholar 

  11. Popovici, A. Popovici, D.: δ—Uniformly decidable sets and Turing machines Lecture Notes in Computer Science. Vol. 1684 (1999) 433–440

    MathSciNet  Google Scholar 

  12. Rudin, W.: Functional Analysis. McGraw-Hill. New York (1973)

    MATH  Google Scholar 

  13. Toffoli, T., Margolus, N.: Cellular automata machines: A new environment for modelling. MIT Press. Cambridge. Massachusetts (1987)

    Google Scholar 

  14. Wold, H.: A Study in the Analysis of Stationary Time Series. Uppsala. Stock- holm (1938)

    MATH  Google Scholar 

  15. Worsch, T.: Parallel Turing machines with one-head control units and cellular automata. Theor. Computer Sci. 217 (1999) 3–30

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Mathematics, University of the West Timişoara, Timişoara, Romania

    Adriana Popovici & Dan Popovici

Authors
  1. Adriana Popovici
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan Popovici
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    C. S. Calude  & M. J. Dinneen  & 

  2. Faculty of Mathematics and Computer Science, “Ovidius” University, Constanta, Romania

    S. Sburlan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag London Limited

About this paper

Cite this paper

Popovici, A., Popovici, D. (2001). On the Structure of Linear Cellular Automata. In: Calude, C.S., Dinneen, M.J., Sburlan, S. (eds) Combinatorics, Computability and Logic. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0717-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0717-0_15

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-526-7

  • Online ISBN: 978-1-4471-0717-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation