On computing the entropy of cellular automata

  • Michele D'amico
  • Giovanni Manzini
  • Luciano Margara
Conference paper

DOI: 10.1007/BFb0055076

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1443)
Cite this paper as:
D'amico M., Manzini G., Margara L. (1998) On computing the entropy of cellular automata. In: Larsen K.G., Skyum S., Winskel G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg

Abstract

We show how to compute the entropy of two important classes of cellular automata namely, linear and positively expansive cellular automata. In particular, we prove a closed formula for the topological entropy of D-dimensional (D ≥ 1) linear cellular automata over the ring Zm (m ≥ 2) and we provide an algorithm for computing the topological entropy of positively expansive cellular automata.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Michele D'amico
    • 1
  • Giovanni Manzini
    • 2
    • 3
  • Luciano Margara
    • 4
  1. 1.Dipartimento di MatematicaUniversità di BolognaBolognaItaly
  2. 2.Dipartimento di Scienze e Tecnologie AvanzateUniversità di TorinoAlessandriaItaly
  3. 3.Istituto di Matematica ComputazionalePisaItaly
  4. 4.Dipartimento di Scienze dell'InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations