Repetitions in Sturmian strings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3991618 (Why is no real title available?)
- scientific article; zbMATH DE number 98759 (Why is no real title available?)
- scientific article; zbMATH DE number 1333603 (Why is no real title available?)
- scientific article; zbMATH DE number 5051583 (Why is no real title available?)
- A characterization of the squares in a Fibonacci string
- An optimal algorithm for computing the repetitions in a word
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Some combinatorial properties of Sturmian words
- Sturmian morphisms and Rauzy's rules
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
Cited in
(11)- Two-pattern strings. I: A recognition algorithm
- A gap of the exponents of repetitions of Sturmian words
- Weak repetitions in Sturmian strings.
- Compressed string-matching in standard Sturmian words
- Circular Sturmian words and Hopcroft's algorithm
- Repetitions in strings: algorithms and combinatorics
- scientific article; zbMATH DE number 2087045 (Why is no real title available?)
- Observed Periodicity Related to the Four-Strand Burau Representation
- The maximal number of runs in standard Sturmian words
- Two-pattern strings. II: Frequency of occurrence and substring complexity
- The number of runs in a string
This page was built for publication: Repetitions in Sturmian strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583533)
