Computing the Topological Entropy of Shifts

Authors:
Christoph Spandl
Affiliations:
Institut für Theoretische Informatik und Mathematik, Universität der Bundeswehr München, D-85577 Neubiberg, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 4
Cited 1

Coded systems

Theoretical Computer Science
Specification, synchronisation, average length

on Coding theory and applications
Computable analysis: an introduction

Computable analysis: an introduction
An Introduction to Symbolic Dynamics and Coding

An Introduction to Symbolic Dynamics and Coding

Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.