Coding rotations on intervals

DOI10.1016/S0304-3975(02)00009-9MaRDI QIDQ1603687zbMATH OpenOpenAlexFDO

Authors Jean Berstel, L. 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)

Abstract: We show that the coding of rotation by $alpha$ on $m$ intervals with rationally independent lengths can be recoded over $m$ Sturmian words of angle $alpha.$ More precisely, for a given $m$ an universal automaton is constructed such that the edge indexed by the vector of values of the $i$th letter on each Sturmian word gives the value of the $i$th letter of the coding of rotation.

Cites work

• Combinatoire des codages de rotations
• Combinatorial properties of sequences defined by the billiard in the tesselation triangles
• scientific article; zbMATH DE number 5051583 (Why is no real title available?)
• Language complexity of rotations and Sturmian sequences
• Sequences with subword complexity \(2n\)
• Three distance theorems and combinatorics on words

Cited in

(7)

• 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
• Relations on words
• Complexity of leading digit sequences
• Episturmian words: a survey
• Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials

This page was built for publication: Coding rotations on intervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603687)