FIBONACCI MORPHISMS AND STURMIAN WORDS

被引：28

作者：

SEEBOLD, P ^{[1
]}

机构：

[1] UNIV LILLE 1,LIFL,CNRS,UA 369,F-59655 VILLENEUVE DASCQ,FRANCE

来源：

THEORETICAL COMPUTER SCIENCE | 1991年 / 88卷 / 02期

关键词：

D O I：

10.1016/0304-3975(91)90383-D

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Marton Kosa (1987) has stated five conjectures devoted to the study of some binary morphisms and the factors of infinite words these morphisms generate. Positive answers to the first four of these conjectures are given in this paper, the main result being the characterization of a class of morphisms whose stationary words are Sturmian.

引用

页码：365 / 384

页数：20

共 50 条

[41] Sturmian words and the Stern sequence
de Luca, Aldo
De Luca, Alessandro
THEORETICAL COMPUTER SCIENCE, 2015, 581 : 26 - 44
[42] Generalized balances in Sturmian words
Fagnot, I
Vuillon, L
DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 83 - 101
[43] Sturmian words, β-shifts, and transcendence
Chi, DP
Kwon, D
THEORETICAL COMPUTER SCIENCE, 2004, 321 (2-3) : 395 - 404
[44] Various Properties of Sturmian Words
Balazi, P.
ACTA POLYTECHNICA, 2005, 45 (05) : 19 - 23
[45] Fractional powers in Sturmian words
Justin, J
Pirillo, G
THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 363 - 376
[46] On a combinatorial property of Sturmian words
Justin, J
Pirillo, G
THEORETICAL COMPUTER SCIENCE, 1996, 154 (02) : 387 - 394
[47] On the permutations generated by Sturmian words
Makarov, M. A.
SIBERIAN MATHEMATICAL JOURNAL, 2009, 50 (04) : 674 - 680
[48] Shurmian morphisms and α-words
Chuan, WF
THEORETICAL COMPUTER SCIENCE, 1999, 225 (1-2) : 129 - 148
[49] Combinatorics of standard Sturmian words
de Luca, A
STRUCTURES IN LOGIC AND COMPUTER SCIENCE, 1997, 1261 : 249 - 267
[50] On the Lie complexity of Sturmian words
De Luca, Alessandro
Fici, Gabriele
THEORETICAL COMPUTER SCIENCE, 2022, 938 : 81 - 85

← 1 2 3 4 5 →