On the complexity functions of Sturmian words
From MaRDI portal
Publication:6498965
Cites work
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 3991618 (Why is no real title available?)
- scientific article; zbMATH DE number 15266 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3324886 (Why is no real title available?)
- scientific article; zbMATH DE number 4187905 (Why is no real title available?)
- A Characterization of the Quadratic Irrationals
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- A lower bound for the arithmetical complexity of Sturmian words
- A new complexity function for words based on periodicity
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Character sums over integers with restricted g-ary digits
- Cyclic complexity of words
- Determination of [nθ] by its Sequence of*Differences
- Fibonacci morphisms and Sturmian words
- Lie complexity of words
- On a generalization of abelian equivalence and complexity of infinite words
- On a new notion of complexity on infinite words
- On sets of integers containing k elements in arithmetic progression
- On the arithmetical complexity of Sturmian words
- On the number of factors of Sturmian words
- Palindrome complexity.
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Sequence entropy and the maximal pattern complexity of infinite words
- Sequences of linear arithmetical complexity
- Sequences of low arithmetical complexity
- Sequences with minimal block growth
- Sturmian Minimal Sets
- Substitution dynamical systems - spectral analysis
- Szemerédi's theorem and problems on arithmetic progressions
- The geometry of Markoff numbers
This page was built for publication: On the complexity functions of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498965)