Substitution dynamical systems on infinite alphabets

DOI10.5802/aif.2242zbMath1147.37007OpenAlexW2278486781MaRDI 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

Dynamical aspects of measure-preserving transformations (37A05) Symbolic dynamics (37B10) Nonsingular (and infinite-measure preserving) transformations (37A40)

Related Items (17)

Some properties of the Fibonacci sequence on an infinite alphabet ⋮ On the complexity of infinite words generated by countable \(q\)-automata ⋮ Harmonic analysis on graphs via Bratteli diagrams and path-space measures ⋮ Self-induced systems ⋮ Mixing properties and entropy bounds of a family of Pisot random substitutions ⋮ Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ Spectral properties of substitutions on compact alphabets ⋮ Entropy pair realization ⋮ Properties and limits of recognition of sets of integers by countable automata ⋮ Substitution-dynamics and invariant measures for infinite alphabet-path space ⋮ Drunken man infinite words complexity ⋮ Profinite automata ⋮ Invariant measures for the subshifts arising from non-primitive substitutions ⋮ Aperiodic substitution systems and their Bratteli diagrams ⋮ Spectral properties of Schrödinger operators associated with almost minimal substitution systems ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ Avoiding squares and overlaps over the natural numbers

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

This page was built for publication: Substitution dynamical systems on infinite alphabets