Skip to main content
SpringerLink
Log in
Book cover

International Conference on Machines, Computations, and Universality

MCU 2004: Machines, Computations, and Universality pp 140–152Cite as

Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3354))

Abstract

We study the subshift behavior of one dimensional cellular automata and we show how to associate to any subshift of finite type a cellular automaton which contains it. The relationships between some topological properties of subshifts and the behavior of the related languages are investigated. In particular we focus our attention to the notion of full transitivity. We characterize the language related to a full transitive subshift extending the notion of irreducibility.

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.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banks, J., Brooks, J., Cairns, G., Davis, G., Stacey, P.: On Devaney’s definition of chaos. American Mathematical Montly 99, 332–334 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cattaneo, G., Dennunzio, A., Margara, L.: Chaotic subshifts and related languages applications to one-dimensional cellular automata. Fundamenta Informaticae 52, 39–80 (2002)

    MATH  MathSciNet  Google Scholar 

  3. Denker, M., Grillenberger, C., Sigmund, K.: Ergodic theory on compact spaces. Lecture Notes in Mathematics, vol. 527. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  4. Devaney, R.L.: An introduction to chaotic dynamical systems, 2nd edn. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  5. Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  6. Walters, P.: An introduction to ergodic theory. Springer, Berlin (1982)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, Via Bicocca degli Arcimboldi 8, 20126, Milano, Italy

    Gianpiero Cattaneo & Alberto Dennunzio

Authors
  1. Gianpiero Cattaneo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Dennunzio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IUT de Metz, LITA, Université Paul Verlaine - Metz, EA 3097, UFR MIM, Île du Saulcy, 57045, Metz, Cédex, France

    Maurice Margenstern

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cattaneo, G., Dennunzio, A. (2005). Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages. In: Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31834-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31834-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25261-0

  • Online ISBN: 978-3-540-31834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation