Weak repetitions in Sturmian strings.
From MaRDI portal
Publication:1401224
DOI10.1016/S0304-3975(02)00574-1zbMath1044.68141MaRDI QIDQ1401224
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the number of factors of Sturmian words
- An optimal algorithm for computing the repetitions in a word
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Weak repetitions in Sturmian strings.
- Descriptions of the Characteristic Sequence of an Irrational
- Automatic Sequences
- Sequences with minimal block growth
This page was built for publication: Weak repetitions in Sturmian strings.
