Skip to main navigation Skip to search Skip to main content

On ergodic linear cellular automata over Zm

  • Gianpiero Cattaneo
  • , Enrico Formenti
  • , Giovanni Manzini
  • , Luciano Margara

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study the ergodic behavior of linear cellular automata over Zm. The main contribution of this paper is an easy-to-check necessary and sufficient condition for a linear cellular automaton over Zm to be ergodic. We prove that, for general cellular automata, ergodicity is equivalent to topological chaos (transitivity and sensitivity to initial conditions). Finally we prove that linear CA over Zp with p prime have dense periodic orbits.

Original languageEnglish
Title of host publicationSTACS 1997 - 14th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsRudiger Reischuk, Michel Morvan
PublisherSpringer Verlag
Pages427-438
Number of pages12
ISBN (Print)9783540626169
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1997 - Lubeck, Germany
Duration: 27 Feb 19971 Mar 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1200
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1997
Country/TerritoryGermany
CityLubeck
Period27/02/971/03/97

Fingerprint

Dive into the research topics of 'On ergodic linear cellular automata over Zm'. Together they form a unique fingerprint.

Cite this