Palindromic sequences generated from marked morphisms

Abstract

Fixed points $\mathbf{u}=\phi (\mathbf{u})$ of marked and primitive morphisms $\phi$ over arbitrary alphabet are considered. We show that if $\mathbf{u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power of $\phi$ has a conjugate in class $\mathcal{P}$. This class was introduced by Hof, Knill, Simon (1995) in order to study palindromic morphic words. Our definitions of marked and well-marked morphisms are more general than the ones previously used by Frid (1999) or Tan (2007). As any morphism with aperiodic fixed point over binary alphabet is marked, our result generalizes the result of Tan. Labbé (2014) demonstrated that already on a ternary alphabet the property of morphisms to be marked is important for the validity of our theorem. The main tool used in our proof is the description of bispecial factors in fixed points of morphisms provided by Klouda (2012).

18 pages, 1 figure

References in corpus (3)

• Bispecial factors in circular non-pushy D0L languages
• Infinite words without palindrome
• A counterexample to a question of Hof, Knill and Simon

Cited by in corpus (3)

• On Words with the Zero Palindromic Defect
• Palindromic length of words and morphisms in class $\mathcal{P}$
• On the Zero Defect Conjecture