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