Factor complexity

A generalized palindromization map in free monoids

The palindromization map $\psi$ in a free monoid $A^{\*}$ was introduced in 1997 by the first author in the case of a binary alphabet $A$, and later extended by other authors to arbitrary alphabets. Acting on infinite words, $\psi$ generates the …

On $\theta$-episturmian words

In this paper we study a class of infinite words on a finite alphabet $A$ whose factors are closed under the image of an involutory antimorphism $\theta$ of the free monoid $A^\*$. We show that given a recurrent infinite word $\omega \in …

A connection between palindromic and factor complexity using return words

In this paper we prove that for any infinite word *w* whose set of factors is closed under reversal, the following conditions are equivalent: 1. all complete returns to palindromes are palindromes; 2. *P* (*n*) + *P* (*n*+1) = *C* (*n*+1) …