On Morphisms Preserving Palindromic Richness
From MaRDI portal
Publication:5066068
DOI10.3233/FI-222102OpenAlexW3037257277MaRDI QIDQ5066068
Francesco Dolce, Edita Pelantová
Publication date: 29 March 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-222102
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a question of Hof, Knill and Simon on palindromic substitutive systems
- On palindromic factorization of words
- Extensions of rich words
- Bispecial factors in circular non-pushy D0L languages
- Palindromic sequences generated from marked morphisms
- Morphic images of episturmian words having finite palindromic defect
- Palindromic complexity of codings of rotations
- Substitutions in dynamics, arithmetics and combinatorics
- Infinite words with finite defect
- Palindromic rich words and run-length encodings
- Palindromic richness
- A characterization of substitutive sequences using return words
- A generalization of Cobham's theorem
- Episturmian words and episturmian morphisms
- EERTREE: an efficient data structure for processing palindromes in strings
- On words with the zero palindromic defect
- Singular continuous spectrum for palindromic Schrödinger operators
- Repetitions in infinite palindrome-rich words
- Acyclic, connected and tree sets
- Specular sets
- A connection between palindromic and factor complexity using return words
- On the number of rich words
- Maximal bifix decoding
- Sturmian jungle (or garden?) on multiliteral alphabets
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Palindromes in infinite ternary words
- Représentation géométrique de suites de complexité $2n+1$
- Derived sequences of complementary symmetric Rote sequences
- The repetition threshold for binary rich words
- Episturmian words: a survey
- Episturmian words and some constructions of de Luca and Rauzy
