3 search results - page 1 / 1 » Improved Bounds on the Length of Maximal Abelian Square-free... |
58
Voted
COMBINATORICS
2004
14 years 9 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...
72
Voted
IWOCA
2009
Springer
15 years 2 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
15 years 10 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...