We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
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, ...
Factored Statistical Machine Translation extends the Phrase Based SMT model by allowing each word to be a vector of factors. Experiments have shown effectiveness of many factors, ...
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...