The following pages link to Repetitions in Sturmian strings (Q1583533):
Displaying 11 items.
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Two-pattern strings. II: Frequency of occurrence and substring complexity (Q925072) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Weak repetitions in Sturmian strings. (Q1401224) (← links)
- Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
- The maximal number of runs in standard Sturmian words (Q1953392) (← links)
- A gap of the exponents of repetitions of Sturmian words (Q2235356) (← links)
- Compressed string-matching in standard Sturmian words (Q2271418) (← links)
- The number of runs in a string (Q2381507) (← links)
- Observed Periodicity Related to the Four-Strand Burau Representation (Q5743085) (← links)