On Words with the Zero Palindromic Defect

  title={On Words with the Zero Palindromic Defect},
  author={Edita Pelantov{\'a} and {\vS}těp{\'a}n Starosta},
We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich word. 
On morphisms preserving palindromic richness
This paper looks for homomorphisms of the free monoid, which allow to construct new rich words from already known rich words, and studies two types of morphisms: Arnoux-Rauzy morphisms and morphisms from Class $P_{ret}$.
Upper bound for palindromic and factor complexity of rich words
This paper proves the inequality for every finite word v with |v| ≥ n + 1 and v(n + 1) closed under reversal, where w is an infinite word whose set of factors is open under reversal.
Rich Words Containing Two Given Factors
A response to an open question how to decide for a given pair of rich words u, v if there is a rich word w such that \(\{u,v\}\subseteq {{\,\mathrm{F}\,}}(w)\).
Construction Of A Rich Word Containing Given Two Factors
A finite word w with |w| = n contains at most n + 1 distinct palindromic factors. If the bound n + 1 is attained, the word w is called rich. Let F(w) be the set of factors of the word w. It is known


On The Palindromic Complexity Of Infinite Words
It is proved that there exist periodic words having the maximum number of palindromes as in the case of Sturmian words, by providing a simple and easy to check condition.
Complexity and palindromic defect of infinite words
Combinatorial properties of f-palindromes in the Thue-Morse sequence ∗
The palindromic defect of a finite word w is defined as D(w) = |w|+ 1 − |Pal(w)| where Pal(w) is the set of its palindromic factors. In this paper we study the problem of computing the palindromic
Exchange of three intervals: Substitutions and palindromicity
Palindromic richness for languages invariant under more symmetries
Reconstructing words from a fixed palindromic length sequence
This paper exhibits some properties of this sequence and introduces the problem of reconstructing a word from GΩ and shows that up to a relabelling the solution is unique for 2‐letter alphabets.
Palindromic richness
Factor versus palindromic complexity of uniformly recurrent infinite words
A Counterexample to a Question of Hof, Knill and Simon
A negative answer is given to a question of Hof, Knill and Simon (1995) concerning purely morphic sequences obtained from primitive morphism containing an infinite number of palindromes about the existence of a counterexample on the ternary alphabet.
Palindromic complexity of codings of rotations