745 search results - page 9 / 149 » The origins of combinatorics on words |
70
Voted
CICLING
2006
Springer
15 years 3 months ago
2006
Springer
The work described in this paper was originally motivated by the
147
click to vote
CPM
2010
Springer
14 years 6 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...
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...
89
Voted
TCS
2008
14 years 11 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...
ITA
2007
14 years 11 months ago
2007
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...