Skip to main navigation Skip to search Skip to main content

A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm

  • Giovanni Manzini
  • , Luciano Margara

Research output: Contribution to journal › Article › peer-review

Abstract

We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide easy-to-check necessary and sufficient conditions for a D-dimensional linear cellular auwbdifq03 tomata over Zm to be sensitive to initial conditions, positively expansive, strongly transitive, and equicontinuous. As a consequence of our results, we have a complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm according to the most important dynamical properties studied in the theory of discrete time dynamical systems.

Original languageEnglish
Pages (from-to)157-177
Number of pages21
JournalTheoretical Computer Science
Volume221
Issue number1-2
DOIs
Publication statusPublished - 28 Jun 1999
Externally publishedYes

Keywords

  • Discrete time dynamical systems
  • Linear cellular automata
  • Topological properties

Fingerprint

Dive into the research topics of 'A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm'. Together they form a unique fingerprint.

Cite this