6533b858fe1ef96bd12b639a
RESEARCH PRODUCT
Fine and Wilf's Theorem for Three periods and a Generalization of Sturmian Words
Antonio RestivoM. Gabriella CastelliFilippo Mignosisubject
Discrete mathematicsPeriodicityEuclid's algorithmCombinatorics on wordsGeneral Computer ScienceGeneralizationSturmian wordSturmian wordsTheoretical Computer ScienceCombinatoricsSet (abstract data type)Combinatorics on wordsWord lengthComputer Science(all)Mathematicsdescription
AbstractWe 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 2n + 1, introduced by Arnoux and Rauzy to generalize Sturmian words, have the same set of factors.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1999-04-01 |