Coding rotations on intervals

DOI10.1016/S0304-3975(02)00009-9zbMath0997.68094arXivmath/0106217OpenAlexW2019928797MaRDI QIDQ1603687

Jean Berstel, Laurent Vuillon

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0106217

zbMATH Keywords

Sturmian words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (7)

Episturmian words: a survey ⋮ Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials ⋮ Relations on words ⋮ Complexity of Leading Digit Sequences ⋮ Itineraries of rigid rotations and diffeomorphisms of the circle ⋮ Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products ⋮ Characterization of rotation words generated by homeomorphisms on a circle

Cites Work

• Combinatorial properties of sequences defined by the billiard in the tesselation triangles
• Language complexity of rotations and Sturmian sequences
• Sequences with subword complexity \(2n\)
• Three distance theorems and combinatorics on words
• Combinatoire des codages de rotations
• Unnamed Item

This page was built for publication: Coding rotations on intervals