Palindromic complexity of codings of rotations

DOI10.1016/j.tcs.2011.08.007zbMath1227.68084OpenAlexW2089081951MaRDI QIDQ650872

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

Publication date: 7 December 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.007

zbMATH Keywords

return wordsSturmiancodings of rotationsfull wordsrote

Mathematics Subject Classification ID

Combinatorics on words (68R15) Special sequences and polynomials (11B83)

Related Items (14)

The physics of polymer chain-folding ⋮ Enumeration Formulæ in Neutral Sets ⋮ On Morphisms Preserving Palindromic Richness ⋮ Palindromic richness for languages invariant under more symmetries ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Rich words in the block reversal of a word ⋮ Morphisms generating antipalindromic words ⋮ Palindromic closures using multiple antimorphisms ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Exchange of three intervals: substitutions and palindromicity ⋮ Neutral and tree sets of arbitrary characteristic ⋮ The repetition threshold for binary rich words ⋮ Upper bound for palindromic and factor complexity of rich words

Uses Software

• SageMath

Cites Work

• Unnamed Item
• 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
• A connection between palindromic and factor complexity using return words
• Return words in Sturmian and episturmian words
• Codings of rotations on two intervals are full
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Échanges d'intervalles et transformations induites
• A remark on morphic sturmian words
• Interval exchange transformations
• A characterization of Sturmian words by return words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Palindromic complexity of codings of rotations