Substitution dynamical systems on infinite alphabets

DOI10.5802/aif.2242zbMath1147.37007MaRDI QIDQ2372778

Sébastien Ferenczi

Publication date: 1 August 2007

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_2006__56_7_2315_0

zbMATH Keywords

measure-preserving system

Mathematics Subject Classification ID

37A05: Dynamical aspects of measure-preserving transformations

37B10: Symbolic dynamics

37A40: Nonsingular (and infinite-measure preserving) transformations

Related Items

Properties and limits of recognition of sets of integers by countable automata, On the complexity of a family of \(k\)-context-free sequences, Avoiding squares and overlaps over the natural numbers, On the complexity of infinite words generated by countable \(q\)-automata, Invariant measures for the subshifts arising from non-primitive substitutions, Drunken man infinite words complexity, Aperiodic substitution systems and their Bratteli diagrams

Cites Work

• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• Substitution dynamical systems - spectral analysis
• Power of words and recognizability of fixpoints of a substitution
• Complexity and special factors
• Complexity of sequences and dynamical systems
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• A characterization of substitutive sequences using return words
• On the complexity of infinite words generated by countable \(q\)-automata
• Arithmetics properties of substitutions and infinite automata
• Entropy of conservative transformations