Everywhere \(\alpha \)-repetitive sequences and Sturmian words

DOI10.1016/J.EJC.2009.01.004zbMath1187.68369OpenAlexW2031814340MaRDI QIDQ1041194

Kalle Saari

Publication date: 1 December 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.01.004

zbMATH Keywords

optimal \(2^{+}\)-repetitive sequencesoptimal 2-repetitive sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

A Square Root Map on Sturmian Words ⋮ On abelian versions of critical factorization theorem ⋮ Abelian combinatorics on words: a survey ⋮ On a faithful representation of Sturmian morphisms ⋮ Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\) ⋮ A square root map on Sturmian words ⋮ More on the dynamics of the symbolic square root map

Cites Work

• Unnamed Item
• Unnamed Item
• On abelian 2-avoidable binary patterns
• Every real number greater than 1 is a critical exponent
• Periodicity and the golden ratio
• The index of Sturmian sequences
• Special factors, periodicity, and an application to Sturmian words
• Locally periodic versus globally periodic infinite words
• Initial powers of Sturmian sequences
• Everywhere α-Repetitive Sequences and Sturmian Words
• Fast Pattern Matching in Strings
• Automatic Sequences
• Standard factors of Sturmian words
• Some properties of the singular words of the Fibonacci word

This page was built for publication: Everywhere \(\alpha \)-repetitive sequences and Sturmian words