95 search results - page 8 / 19 » Combinatorics on words |
CPM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
TCS
2008
13 years 8 months ago
2008
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
COMBINATORICS
2004
13 years 8 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
COMBINATORICS
2006
13 years 8 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 ...