Repetitions in Sturmian strings
From MaRDI portal
Publication:1583533
DOI10.1016/S0304-3975(00)00063-3zbMath0949.68124WikidataQ126863050 ScholiaQ126863050MaRDI QIDQ1583533
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
The number of runs in a string ⋮ Two-pattern strings. II: Frequency of occurrence and substring complexity ⋮ Circular Sturmian words and Hopcroft's algorithm ⋮ Repetitions in strings: algorithms and combinatorics ⋮ Two-pattern strings. I: A recognition algorithm
Cites Work
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- An optimal algorithm for computing the repetitions in a word
- Sturmian morphisms and Rauzy's rules
- Some combinatorial properties of Sturmian words
- A characterization of the squares in a Fibonacci string
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Repetitions in Sturmian strings
