3 search results - page 1 / 1 » Improved Bounds on the Length of Maximal Abelian Square-free... |
COMBINATORICS
2004
13 years 4 months ago
2004
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
IWOCA
2009
Springer
13 years 9 months ago
2009
Springer
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...