Article thumbnail

On Computing the Topological Entropy of one-sided Cellular Automata

By Pietro Di Lena

Abstract

The topological entropy of cellular automata is general not computable. We identify and characterize a subclass of one-sided cellular automata for which it is and we show that the membership in this class is undecidable

Topics: UNDECIDABILITY, CELLULAR AUTOMATA, TOPOLOGICAL ENTROPY
Year: 2007
OAI identifier: oai:cris.unibo.it:11585/127294
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/11585/12... (external link)
  • http://www.oldcitypublishing.c... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.