Palindromic complexity of codings of rotations
From MaRDI portal
Recommendations
- Combinatoire des codages de rotations
- scientific article; zbMATH DE number 5501412
- Palindrome complexity bounds for primitive substitution sequences
- Palindromic complexity of trees
- Total palindrome complexity of finite words
- On powers of words occurring in binary codings of rotations
- Language complexity of rotations and Sturmian sequences
- The palindromic cyclic reduction and related algorithms
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Recursively renewable words and coding of irrational rotations
Cites work
- scientific article; zbMATH DE number 5855061 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- A characterization of Sturmian words by return words
- A connection between palindromic and factor complexity using return words
- A remark on morphic sturmian words
- Codings of rotations and continued fractions
- Codings of rotations on two intervals are full
- Dynamics for rotation pseudogroups
- Episturmian words and some constructions of de Luca and Rauzy
- Interval exchange transformations
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Palindromes and two-dimensional Sturmian sequences
- Palindromic richness
- Return words in Sturmian and episturmian words
- Rotation encoding and self-similarity phenomenon
- Sequences with subword complexity \(2n\)
- Three distance theorems and combinatorics on words
- Échanges d'intervalles et transformations induites
Cited in
(17)- On Morphisms Preserving Palindromic Richness
- Ostrowski-automatic sequences: theory and applications
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function
- Codings of rotations on two intervals are full
- Morphisms generating antipalindromic words
- Palindromic closures using multiple antimorphisms
- scientific article; zbMATH DE number 5501412 (Why is no real title available?)
- Neutral and tree sets of arbitrary characteristic
- Upper bound for palindromic and factor complexity of rich words
- Palindromic richness for languages invariant under more symmetries
- Rich words in the block reversal of a word
- Exchange of three intervals: substitutions and palindromicity
- Morphic images of episturmian words having finite palindromic defect
- The repetition threshold for binary rich words
- Recursively renewable words and coding of irrational rotations
- Enumeration formulæ in neutral sets
- The physics of polymer chain-folding
This page was built for publication: Palindromic complexity of codings of rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650872)
