EPISTURMIAN WORDS: A SURVEY

被引:55
作者
Glen, Amy [1 ,2 ]
Justin, Jacques [3 ]
机构
[1] Univ Quebec, LaCIM, Montreal, PQ H3C 3P8, Canada
[2] Reykjavik Univ, Math Inst, IS-103 Reykjavik, Iceland
[3] Univ Paris Diderot, LIAFA, F-75205 Paris 13, France
来源
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 2009年 / 43卷 / 03期
关键词
Combinatorics on words; episturmian words; Arnoux-Rauzy sequences; Sturmian words; episturmian morphisms; STURMIAN WORDS; SYMBOLIC DYNAMICS; PALINDROMIC COMPLEXITY; INFINITE WORDS; SEQUENCES; MORPHISMS; THEOREM; POWERS; REPRESENTATION; TRANSCENDENCE;
D O I
10.1051/ita/2009003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic properties, we consider episturmian morphisms that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their connection to the balance property, and related notions such as finite episturmian words, Arnoux-Rauzy sequences, and "episkew words" that generalize the skew words of Morse and Hedlund.
引用
收藏
页码:403 / 442
页数:40
相关论文
共 117 条
[1]  
Adamczewski B, 2003, THEOR COMPUT SCI, V307, P47, DOI [10.1016/S0304-3975(03)00092-6, 10.1016/S0324-3975(03)00092-6]
[2]  
ADAMCZEWSKI B, J EUR MATH IN PRESS
[3]   Palindromic continued fractions [J].
Adamczewski, Boris ;
Bugeaud, Yann .
ANNALES DE L INSTITUT FOURIER, 2007, 57 (05) :1557-1574
[4]  
Alessandri P., 1998, ENSEIGN MATH, V44, P103
[5]  
Allouche J.P., 2003, Automatic Sequences: Theory, Applications, Generalizations
[6]   Transcendence of Sturmian or morphic continued fractions [J].
Allouche, JP ;
Davison, JL ;
Queffélec, M ;
Zamboni, LQ .
JOURNAL OF NUMBER THEORY, 2001, 91 (01) :39-66
[7]  
ALLOUCHE JP, EXTREMAL PROPE UNPUB
[8]   Palindromic complexity of infinite words associated with simple Parry numbers [J].
Ambroz, Petr ;
Masakova, Zuzana ;
Pelantova, Edita ;
Frougny, Christiane .
ANNALES DE L INSTITUT FOURIER, 2006, 56 (07) :2131-2160
[9]  
[Anonymous], 1993, J. Theor. Nombres Bordeaux
[10]  
[Anonymous], SEM NUMB THEOR 1982