24 search results - page 2 / 5 » Combinatorics on partial word correlations |
82
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
109
click to vote
LATA
2010
Springer
15 years 4 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
128
click to vote
DAM
2007
15 years 1 months ago
2007
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
142
click to vote
DAM
2011
14 years 8 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
125
click to vote
DLT
2007
15 years 3 months ago
2007
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...