Name
Abstract | ||
|---|---|---|
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let pexpi(w) be the supremum of the exponent over the products (concatenation) of i factors of the word w. The repetition threshold Image 1 is then the infimum of pexpi(w) over all words w∈Σkω. Mousavi and Shallit obtained that Image 2 and Image 3. We show that Image 4 if i is even and Image 5 if i is odd and i⩾3. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.tcs.2019.04.013 | Theoretical Computer Science |
Keywords | Field | DocType |
Words,Repetition avoidance | Discrete mathematics,Combinatorics,Exponent,Infimum and supremum,Concatenation,Combinatorics on words,Mathematics | Journal |
Volume | ISSN | Citations |
791 | 0304-3975 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pamela Fleischmann | 1 | 2 | 3.75 |
| Pascal Ochem | 2 | 258 | 36.91 |
| Kamellia Reshadi | 3 | 0 | 0.34 |