Lyndon factorization of sturmian words

被引:17
|
作者
Melançon, G [1 ]
机构
[1] Univ Bordeaux 1, LaBRI, URA 1304 CNRS, F-33405 Talence, France
关键词
D O I
10.1016/S0012-365X(99)00123-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We express any general characteristic sturmian word as a unique infinite non-increasing product of Lyndon words. Using this identity, we give a new omega-division for characteristic sturmian words. We also give a short proof of a result by Berstel and de Luca (Sturmian words, Lyndon words and trees, Theoret. Comput. Sci. 178 (1997) 171-203.); more precisely, we show that the set of factors of sturmian words that qualify as Lyndon words is the set of primitive Christoffel words. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:137 / 149
页数:13
相关论文
共 50 条