Name
Abstract | ||
|---|---|---|
We extend the theorem of Fine and Wilf to words having three periods. We then define the set 3-PER of words of maximal length for which such result does not apply. We prove that the set 3-PER and the sequences of complexity 2 n + 1, introduced by Arnoux and Rauzy to generalize Sturmian words, have the same set of factors. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0304-3975(98)00251-5 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Combinatorics on words,Sturmian words,Periodicity,Sturmian word,Euclid's algorithm | Journal | 218 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 32 |
PageRank | References | Authors |
4.20 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Gabriella Castelli | 1 | 32 | 4.20 |
| Filippo Mignosi | 2 | 569 | 99.71 |
| Antonio Restivo | 3 | 697 | 107.05 |