Skip to main content

Chaotic Subshifts Generated by One Dimensional Elementary CA. The Role of Transitivity

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2002)

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

Included in the following conference series:

  • 1210 Accesses

Abstract

We present the behavior of simple subshifts generated by 1D Elementary CA (ECA) with respect to some components of chaoticity as transitivity, topological mixing and strong transitivity. A classification of subshifts generated by ECA with respect to transitivity is given. In literature one can find several notions of topological transitivity. We discuss two types of transitivity for discrete time dynamical system: positive and full. The relationships among these notions and properties such as existence of a dense orbit, topological chaos and indecomposability are investigated.

This work has been supported by M.I.U.R. COFIN project ”Formal Languages and Automata: Theory and Application”

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. J. Banks, J. Brooks, G. Cairns, G. Davis, and P. Stacey, On Devaney’s definition of chaos, American Mathematical Montly 99 (1992), 332–334.

    Article  MATH  MathSciNet  Google Scholar 

  2. F. Blanchard, P. Kurka, and A. Maas, Topological and measure-theoretic properties of one-dimensional cellular automata, Physica D 103 (1997), 86–99.

    Article  MathSciNet  Google Scholar 

  3. G. Cattaneo and A. Dennunzio, On transitivity of a discrete time dynamical system, Preprint, 2002.

    Google Scholar 

  4. G. Cattaneo, A. Dennunzio, and L. Margara, Chaotic subshifts and related languages applications to one-dimensional cellular automata, To appear in Fundamenta Informaticae, 2002.

    Google Scholar 

  5. B. Codenotti and L. Margara, Transitive cellular automata are sensitive, American Mathematical Monthly 103 (1996), 58–62.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Denker, C. Grillenberger, and K. Sigmund, Ergodic theory on compact spaces, Lecture Notes in Mathematics, vol. 527, Springer-Verlag, 1976.

    Google Scholar 

  7. R. L. Devaney, An introduction to chaotic dynamical systems, second ed., Addison Wesley, 1989.

    Google Scholar 

  8. E. Glasner and B. Weiss, Sensitive dependence on initial condition, Nonlinearity 6 (1993), 1067–1075.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Kameyama, Topological transitivity and strong transitivity, Preprint, 2001.

    Google Scholar 

  10. J. P. LaSalle, Stability theory for difference equations, MAA Studies in Math., American Mathematical Society, 1976.

    Google Scholar 

  11. D. Ruelle, Strange attractors, Math. Intelligencer 2 (1980), 126–137.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Vellekoop and R. Berglund, On intervals, transitivity = chaos, American Mathematical Monthly 101 (1994), 353–355.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cattaneo, G., Dennunzio, A. (2002). Chaotic Subshifts Generated by One Dimensional Elementary CA. The Role of Transitivity. In: Bandini, S., Chopard, B., Tomassini, M. (eds) Cellular Automata. ACRI 2002. Lecture Notes in Computer Science, vol 2493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45830-1_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45830-1_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45830-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics