scholarly journals Sturmian words, Lyndon words and trees

1997 ◽  
Vol 178 (1-2) ◽  
pp. 171-203 ◽  
Author(s):  
Jean Berstel ◽  
Aldo de Luca
Keyword(s):  
Author(s):  
Christophe Reutenauer

This chapter covers the lexicographical ordering of lower Christoffel words, which is equivalent to the ordering by their slopes (Borel and Laubie). Lower Christoffel words are particular Lyndon words. They are maximum for the lexicographical order among Lyndon words of a given slope (Borel and Laubie). They are, together with the upper Christoffel words, the only unbordered finite Sturmian words (Chuan). They are exactly the Lyndon words which are Sturmian words (Berstel and de Luca). The standard factorization of a lower Christoffel word is obtained by cutting before the smallest lexicographical suffix. Finally, they are exactly the Lyndon words which are equilibrated (Melançon).


Author(s):  
Christophe Reutenauer

Christoffel introduced in 1875 a special class of words on a binary alphabet, linked to continued fractions. Some years laterMarkoff published his famous theory, called nowMarkoff theory. It characterizes certain quadratic forms, and certain real numbers by extremal inequalities. Both classes are constructed by using certain natural numbers, calledMarkoff numbers; they are characterized by a certain diophantine equality. More basically, they are constructed using certain words, essentially the Christoffel words. The link between Christoffelwords and the theory ofMarkoffwas noted by Frobenius.Motivated by this link, the book presents the classical theory of Markoff in its two aspects, based on the theory of Christoffel words. This is done in Part I of the book. Part II gives the more advanced and recent results of the theory of Christoffel words: palindromes (central words), periods, Lyndon words, Stern–Brocot tree, semi-convergents of rational numbers and finite continued fractions, geometric interpretations, conjugation, factors of Christoffel words, finite Sturmian words, free group on two generators, bases, inner automorphisms, Christoffel bases, Nielsen’s criterion, Sturmian morphisms, and positive automorphisms of this free group.


2004 ◽  
Vol 15 (02) ◽  
pp. 349-354 ◽  
Author(s):  
TERO HARJU ◽  
DIRK NOWOTKA

A word v=wu is a (nontrivial) Duval extension of the unbordered word w, if (u is not a prefix of v and) w is an unbordered factor of v of maximum length. After a short survey of the research topic related to Duval extensions, we show that, if wu is a minimal Duval extension, then u is a factor of w. We also show that finite, unbordered factors of Sturmian words are Lyndon words.


2018 ◽  
Vol 95 ◽  
pp. 53-64
Author(s):  
Antonio Giambruno ◽  
Mikhail Zaicev
Keyword(s):  

1995 ◽  
Vol 09 (25) ◽  
pp. 3241-3268 ◽  
Author(s):  
ZENGO TSUBOI ◽  
MASUO SUZUKI

The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of the coefficients are derived.


2001 ◽  
Vol 14 (2) ◽  
pp. 240-245 ◽  
Author(s):  
F. Ruskey ◽  
C. R. Miers ◽  
J. Sawada

10.37236/2473 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Paweł Baturo ◽  
Marcin Piątkowski ◽  
Wojciech Rytter

We investigate some repetition problems for a very special class $\mathcal{S}$ of strings called the standard Sturmian words, which  have very compact representations in terms of sequences of integers. Usually the size of this word is exponential with respect to the size of its integer sequence, hence we are dealing with repetition problems in compressed strings. An explicit formula is given for the number $\rho(w)$ of runs in a standard word $w$. We show that $\rho(w)/|w|\le 4/5$ for each $w\in S$, and  there is an infinite sequence of strictly growing words $w_k\in {\mathcal{S}}$ such that $\lim_{k\rightarrow \infty} \frac{\rho(w_k)}{|w_k|} = \frac{4}{5}$. Moreover, we show how to compute the number of runs in a standard Sturmian word in linear time with respect to the size of its compressed representation.


Sign in / Sign up

Export Citation Format

Share Document