Sciweavers

672 search results - page 4 / 135
» Words and forbidden factors
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Linear time algorithms for Clobber
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...
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 7 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, ...
ACL
2010
13 years 5 months ago
Fixed Length Word Suffix for Factored Statistical Machine Translation
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, ...
Narjes Sharif Razavian, Stephan Vogel
TCS
2010
13 years 2 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
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...
Thomas Colcombet
DLT
2008
13 years 9 months ago
On the Relation between Periodicity and Unbordered Factors of Finite Words
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...
Stepan Holub, Dirk Nowotka