Episturmian words and some constructions of de Luca and Rauzy

被引：197

作者：

Droubay, X

Justin, J

Pirillo, G

机构：

[1] LIAFA, F-75251 Paris 05, France

[2] Univ Picardie Jules Verne, CURI, LaRIA, F-80000 Amiens, France

[3] IAMI CNR, I-50134 Florence, Italy

[4] Univ Marne Vallee, F-77454 Marne La Vallee 2, France

来源：

THEORETICAL COMPUTER SCIENCE | 2001年 / 255卷 / 1-2期

关键词：

Sturmian words; palindrome factors; Rauzy rules; Episturmian words;

D O I：

10.1016/S0304-3975(99)00320-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we study infinite episturmian words which are a natural generalization of Sturmian words to an arbitrary alphabet. A characteristic property is: they are closed under reversal and have at most one right special factor of each length, They are first obtained by a construction due to de LUCA which utilizes the palindrome closure. They can also be obtained by the way of extended RAUZY rules. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：539 / 553

页数：15

共 12 条

[1] GEOMETRIC REPRESENTATION OF SEQUENCES OF COMPLEXITY 2N+1 [J].

ARNOUX, P ;

RAUZY, G .

BULLETIN DE LA SOCIETE MATHEMATIQUE DE FRANCE, 1991, 119 (02) :199-215

[2]

BERSTEL J, 1999, ALGEBRAIC COMBINATOR, pCH2

[3]

CRISP D, 1993, J THEOR NOMBR BORDX, V5, P123

[4] Sturmian words: structure, combinatorics, and their arithmetics [J].

deLuca, A .

THEORETICAL COMPUTER SCIENCE, 1997, 183 (01) :45-82

[5] Standard Sturmian morphisms [J].

deLuca, A .

THEORETICAL COMPUTER SCIENCE, 1997, 178 (1-2) :205-224

[6] Palindromes and Sturmian words [J].

Droubay, X ;

Pirillo, G .

THEORETICAL COMPUTER SCIENCE, 1999, 223 (1-2) :73-85

[7] Decimations and Sturmian words [J].

Justin, J ;

Pirillo, G .

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (03) :271-290

[8]

Mignosi F., 1993, J THEOR NOMBRES BORD, V5, P221

[9]

RAUZY G, 1982, B SOC MATH FR, V110, P147

[10]

RAUZY G, 1985, LECT NOTES COMPUT SC, V192, P167

← 1 2 →