Reduced Rauzy graph

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) …