Repetitions in Sturmian strings
From MaRDI portal
Publication:1583533
DOI10.1016/S0304-3975(00)00063-3zbMATH Open0949.68124WikidataQ126863050 ScholiaQ126863050MaRDI QIDQ1583533FDOQ1583533
Authors: R. Smith
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- An optimal algorithm for computing the repetitions in a word
- Title not available (Why is that?)
- Some combinatorial properties of Sturmian words
- Sturmian morphisms and Rauzy's rules
- Title not available (Why is that?)
- A characterization of the squares in a Fibonacci string
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Title not available (Why is that?)
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Title not available (Why is that?)
Cited In (9)
- 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
- Title not available (Why is that?)
- Observed Periodicity Related to the Four-Strand Burau Representation
- Two-pattern strings. II: Frequency of occurrence and substring complexity
- The number of runs in a string
- Two-pattern strings. I: A recognition algorithm
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)