On the complexity functions of Sturmian words

Cites Work

Title not available (Why is that?)
Palindrome complexity.
Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
On sets of integers containing k elements in arithmetic progression
Substitution dynamical systems - spectral analysis
AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
Character sums over integers with restricted \(g\)-ary digits
Title not available (Why is that?)
On the number of factors of Sturmian words
Sequence entropy and the maximal pattern complexity of infinite words
Sequences with minimal block growth
Szemerédi's theorem and problems on arithmetic progressions
On a generalization of abelian equivalence and complexity of infinite words
Title not available (Why is that?)
A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
Beatty Sequences, Continued Fractions, and Certain Shift Operators
Determination of [nθ] by its Sequence of^*Differences
Title not available (Why is that?)
Another generalization of abelian equivalence: binomial complexity of infinite words
Fibonacci morphisms and Sturmian words
Cyclic complexity of words
A Characterization of the Quadratic Irrationals
Title not available (Why is that?)
Sequences of linear arithmetical complexity
The geometry of Markoff numbers
On the arithmetical complexity of Sturmian words
Sequences of low arithmetical complexity
Title not available (Why is that?)
Sturmian Minimal Sets
A new complexity function for words based on periodicity
On a new notion of complexity on infinite words
A lower bound for the arithmetical complexity of Sturmian words
Lie complexity of words

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)