A note on abelian returns in rotation words
From MaRDI portal
Publication:2437858
DOI10.1016/j.tcs.2014.01.033zbMath1295.68179MaRDI QIDQ2437858
Narad Rampersad, Michel Rigo, Pavel Salimov
Publication date: 13 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.033
Sturmian word; abelian complexity; three gap theorem; rotation word; abelian equivalent; abelian return
68R15: Combinatorics on words
Related Items
Cites Work
- Reversible Christoffel factorizations
- Rotation encoding and self-similarity phenomenon
- Balances for fixed points of primitive substitutions.
- Three distance theorems and combinatorics on words
- Abelian complexity of minimal subshifts
- Combinatoire des codages de rotations
- On a conjecture of Erdös and Szüsz related to uniform distribution mod 1
- Abelian returns in Sturmian words
- Unnamed Item
- Unnamed Item