Codings of rotations on two intervals are full

DOI10.1016/j.endm.2009.07.047zbMath1273.68290OpenAlexW1982828667MaRDI QIDQ2851477

Alexandre Blondin Massé, Srečko Brlek, Laurent Vuillon, Sébastien Labbé

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.archipel.uqam.ca/8433/1/Blondin-Mass%C3%A9-2009a-preprint.pdf

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Derived sequences of complementary symmetric Rote sequences ⋮ Palindromic complexity of codings of rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Rotation encoding and self-similarity phenomenon
• Palindromic richness
• Codings of rotations and continued fractions
• Dynamics for rotation pseudogroups
• Sequences with subword complexity \(2n\)
• Three distance theorems and combinatorics on words
• Palindromic complexity of infinite words associated with simple Parry numbers
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Échanges d'intervalles et transformations induites
• A remark on morphic sturmian words
• Interval exchange transformations
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Codings of rotations on two intervals are full