scientific article; zbMATH DE number 5051583
From MaRDI portal
Publication:5486010
Cited in
(49)- On smooth sets of integers
- Uniform spectral properties of one-dimensional quasicrystals. IV. Quasi-Sturmian potentials
- Balanced words and dynamical systems
- Codings of rotations and continued fractions
- Intertwinings of periodic sequences
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
- Limit values of the recurrence quotient of Sturmian sequences
- Lyndon words and singular factors of sturmian words
- Complexity for finite factors of infinite sequences
- A simple characterization of Sturm numbers
- The index of Sturmian sequences
- Weak repetitions in Sturmian strings.
- Hierarchical structures in Sturmian dynamical systems
- Some properties of the factors of Sturmian sequences.
- Invertible substitutions and Sturmian sequences.
- Repetitions in Sturmian strings
- The complexity of functions on lattices
- Invertible substitutions and local isomorphisms
- Coding rotations on intervals
- Episturmian words and episturmian morphisms
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions
- Asymptotic behavior of non-expanding piecewise linear maps in the presence of random noise
- Dynamical upper bounds for one-dimensional quasicrystals
- Substitution invariant Sturmian bisequences
- Palindrome complexity.
- Invertible substitutions on a three-letter alphabet.
- Powers in Sturmian sequences
- The structure of invertible substitutions on a three-letter alphabet
- Palindromes and Sturmian words
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs
- Abelian periods of factors of Sturmian words
- Arnoux-Rauzy substitutions and Palindrome words
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
- Words derivated from Sturmian words
- Two-variable word equations
- On some factorizations of infinite words by elements of codes
- Morphisms preserving the set of words coding three interval exchange
- On a characteristic property of ARNOUX–RAUZY sequences
- The structure of invertible substitutions on a three-letter alphabet
- The sequence of return words of the Fibonacci sequence
- Sturmian words and a criterium by Michaux-Villemaire
- Double sequences of low complexity
- Covering numbers: Arithmetics and dynamics for rotations and interval exchanges
- Finite section method for aperiodic Schrödinger operators
- On the minimal complexity of infinite words
- The factor composition matrix of sequences
- Entropy rates and finite-state dimension
- Complexity of cutting words on regular tilings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486010)
