Sciweavers

19866 search results - page 70 / 3974
» Computing all factorizations in ***
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
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: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...