Computing the Topological Entropy of Shifts

https://doi.org/10.1016/j.entcs.2006.08.011Get rights and content
Under a Creative Commons license
open access

Abstract

Different characterizations of classes of shift dynamical systems via labeled digraphs, languages and sets of forbidden words are investigated. The corresponding naming systems are analyzed according to reducibility and particularly with regard to the computability of the topological entropy relative to the presented naming systems. It turns out that all examined natural representations separate into two equivalence classes and that the topological entropy is not computable in general with respect to the defined natural representations. However, if a specific labeled digraph representation - namely primitive, right-resolving labeled digraphs - of some class of shifts is considered, namely the shifts having the specification property, then the topological entropy gets computable.

Keywords

Shift dynamical systems
topological entropy
Type-2 computability
labeled digraphs

Cited by (0)