On the complexity functions of Sturmian words
From MaRDI portal
Publication:6498965
DOI10.22405/2226-8383-2023-24-4-63-77MaRDI QIDQ6498965
Valeriya Orlanovna Kirova, Igor' Valentinovich Godunov
Publication date: 8 May 2024
Published in: Chebyshevskiĭ Sbornik (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalization of abelian equivalence and complexity of infinite words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Cyclic complexity of words
- Sequences of linear arithmetical complexity
- On the number of factors of Sturmian words
- The geometry of Markoff numbers
- Substitution dynamical systems - spectral analysis
- Fibonacci morphisms and Sturmian words
- Palindrome complexity.
- Character sums over integers with restricted \(g\)-ary digits
- Lie complexity of words
- On the arithmetical complexity of 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
- Sequences of low arithmetical complexity
- Szemerédi's theorem and problems on arithmetic progressions
- On sets of integers containing k elements in arithmetic progression
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Determination of [nθ by its Sequence of*Differences]
- A Characterization of the Quadratic Irrationals
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Sequence entropy and the maximal pattern complexity of infinite words
- Sequences with minimal block growth
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- Sturmian Minimal Sets
This page was built for publication: On the complexity functions of Sturmian words
