Coding of substitution dynamical systems as shifts of finite type
Author
Date
2016-05-01Type
Article
View/ Open
Access rights
Open access 

Metadata
Show full item recordAbstract
We develop a theory that allows us to code dynamical systems induced by primitive substitutions continuously as shifts of finite type in many different ways. The well-known prefix-suffix coding turns out to correspond to one special case. We precisely analyse the basic properties of these codings (injectivity, coding of the periodic points, properties of the presentation graph, interaction with the shift map). A lot of examples illustrate the theory and show that, depending on the particular coding, several amazing effects may occur. The results give new insights into the theory of substitution dynamical systems and might serve as a powerful tool for further researches.
How to cite this document
Surer, Paul. Coding of substitution dynamical systems as shifts of finite type. Ergodic Theory and Dynamical Systems, v. 36, n. 3, p. 944-972, 2016. Available at: <http://hdl.handle.net/11449/172953>.
Language
English
Grant number
Collections
