Advertisement

On the Structure of Linear Cellular Automata

  • Adriana Popovici
  • Dan Popovici
Part of the Discrete Mathematics and Theoretical Computer Science book series (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.

Keywords

Hilbert Space Cellular Automaton Closed Subspace Local Rule Toeplitz Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BSL]
    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). SpringerGoogle Scholar
  2. [CFMM]
    Cattaneo, G., Formenti, E., Margara, L., Mauri, G.: On the dynamical behavior of chaotic cellular automata. Theor. Computer Sci. 217 (1999) 31–51MathSciNetMATHCrossRefGoogle Scholar
  3. [CD]
    Chopard, B., Droz, M.: Cellular automata modelling of physical systems. Cambridge University Press. Cambridge (1998)CrossRefGoogle Scholar
  4. [CPY]
    Culik, K., Pachl, J., Yu, S.: On the limit sets of cellular automata. SIAM J. Comput. 18 (1989) 831–842MathSciNetMATHGoogle Scholar
  5. [DF]
    Duff, M.J.B., Fountain, T.J.: Cellular Logic Image Processing. Academic Press (1986)Google Scholar
  6. [DM]
    Durand, B., Mazoyer, J.: Growing Patterns in 1D Cellular Automata. Lecture Notes in Computer Science. (1994) 211–220Google Scholar
  7. [Hu]
    Hurd, L.P.: Formal language characterizations of cellular automata limit sets. Complex Systems. 1 (1987) 69–80MathSciNetMATHGoogle Scholar
  8. [vNe]
    von Neumann, J.: Theory of self-reproducing automata. Illinois University Press. Illinois. Edited and completed by A.W. Burks (1966)Google Scholar
  9. [PP1]
    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–296Google Scholar
  10. PP2] Popovici, A., Popovici, D.: Codes and Classes of Cellular Automata. To appear.Google Scholar
  11. [PP3]
    Popovici, A. Popovici, D.: δ—Uniformly decidable sets and Turing machines Lecture Notes in Computer Science. Vol. 1684 (1999) 433–440MathSciNetGoogle Scholar
  12. [Ru]
    Rudin, W.: Functional Analysis. McGraw-Hill. New York (1973)MATHGoogle Scholar
  13. [TM]
    Toffoli, T., Margolus, N.: Cellular automata machines: A new environment for modelling. MIT Press. Cambridge. Massachusetts (1987)Google Scholar
  14. [Wol]
    Wold, H.: A Study in the Analysis of Stationary Time Series. Uppsala. Stock- holm (1938)MATHGoogle Scholar
  15. [Wor]
    Worsch, T.: Parallel Turing machines with one-head control units and cellular automata. Theor. Computer Sci. 217 (1999) 3–30MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • Adriana Popovici
    • 1
  • Dan Popovici
    • 1
  1. 1.Department of Computer Science and MathematicsUniversity of the West TimişoaraTimişoaraRomania

Personalised recommendations