EUDML

We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a sturmian word. In particular, the corresponding set for the Fibonacci word is the set of Fibonacci numbers. As a by-product of our results, we give several new proofs and tightenings of well-known properties of sturmian words.

Least Periods of Factors of Infinite Words

James D. Currie; Kalle Saari — 2008

RAIRO - Theoretical Informatics and Applications

We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci word is the set of Fibonacci numbers. As a by-product of our results, we give several new proofs and tightenings of well-known properties of Sturmian words.

Page 1

Download Results (CSV)

Advanced Search

Formula preview

Currently displaying 1 – 8 of 8

A note on antichains of words.

There are ternary circular square-free words of length $n$ for $n \geq$ 18.

There exist binary circular $5 / 2^{+}$ power free words of every length.

Non-repetitive tilings.

For each $α > 2$ there is an infinite binary word with critical exponent $α$ .

The number of ternary words avoiding abelian cubes grows exponentially.

Least periods of factors of infinite words

Least Periods of Factors of Infinite Words