4 search results - page 1 / 1 » Binary De Bruijn Partial Words with One Hole |
TAMC
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
DM
2010
13 years 4 months ago
2010
We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the max...
LATA
2010
Springer
13 years 8 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...
DAM
2011
12 years 11 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...