95 search results - page 6 / 19 » Combinatorics on words |
COMBINATORICS
2006
13 years 8 months ago
2006
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes that tile the plane by translation: a polyomino tiles the plane by translation...
CPM
2001
Springer
14 years 29 days ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
COMBINATORICS
2002
13 years 8 months ago
2002
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
MFCS
2004
Springer
14 years 1 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...