Morphic images of episturmian words having finite palindromic defect
From MaRDI portal
(Redirected from Publication:499487)
Abstract: We study morphisms from certain classes and their action on episturmian words. The first class is . In general, a morphism of class can map an infinite word having zero palindromic defect to a word having infinite palindromic defect. We show that the image of an episturmian word, which has zero palindromic defect, under a morphism of class has always its palindromic defect finite. We also focus on letter-to-letter morphisms to binary alphabet: we show that images of ternary episturmian words under such morphisms have zero palindromic defect. These results contribute to the study of an unsolved question of characterization of morphisms that preserve finite (resp. zero) palindromic defect. They also enable us to construct new examples of binary -rich and almost -rich words, where is the group generated by both involutory antimorphisms on a binary alphabet.
Recommendations
Cites work
- A characterization of substitutive sequences using return words
- A connection between palindromic and factor complexity using return words
- A new characteristic property of rich words
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- Complexity and special factors
- Constructions of words rich in palindromes and pseudopalindromes
- Episturmian morphisms and a Galois theorem on continued fractions
- Episturmian words and episturmian morphisms
- Episturmian words and some constructions of de Luca and Rauzy
- Episturmian words: a survey
- Factor versus palindromic complexity of uniformly recurrent infinite words
- Generalized Thue-Morse words and palindromic richness
- Infinite words with finite defect
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On a Family of Morphic Images of Arnoux-Rauzy Words
- On different generalizations of episturmian words
- Palindromes in infinite ternary words
- Palindromic complexity of codings of rotations
- Palindromic richness
- Palindromic richness for languages invariant under more symmetries
- Proof of the Brlek-Reutenauer conjecture
- Représentation géométrique de suites de complexité $2n+1$
- Return words in Sturmian and episturmian words
- Rich and Periodic-Like Words
- Sequences with subword complexity \(2n\)
- Sturmian and Episturmian Words
- Sturmian jungle (or garden?) On multiliteral alphabets
Cited in
(3)
This page was built for publication: Morphic images of episturmian words having finite palindromic defect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499487)