FIBONACCI MORPHISMS AND STURMIAN WORDS

被引:28
|
作者
SEEBOLD, P [1 ]
机构
[1] UNIV LILLE 1,LIFL,CNRS,UA 369,F-59655 VILLENEUVE DASCQ,FRANCE
关键词
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 条
  • [21] DECIDABILITY FOR STURMIAN WORDS
    Hieronymi, Philipp
    Ma, Dun
    Oei, Reed
    Schaeffer, Luke
    Schulz, Chris
    Shallit, Jeffrey
    LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 20 (03)
  • [22] Decimations and Sturmian words
    Justin, J
    Pirillo, G
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (03): : 271 - 290
  • [23] Words derivated from Sturmian words
    Araújo, IM
    Bruyère, W
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 204 - 219
  • [24] A characterization of sturmian words by return words
    Vuillon, L
    EUROPEAN JOURNAL OF COMBINATORICS, 2001, 22 (02) : 263 - 275
  • [25] Sturmian words and words with a critical exponent
    Vandeth, D
    THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 283 - 300
  • [26] A note on Sturmian words
    Perrin, Dominique
    Restivo, Antonio
    THEORETICAL COMPUTER SCIENCE, 2012, 429 : 265 - 272
  • [27] Palindromes and Sturmian words
    Droubay, X
    Pirillo, G
    THEORETICAL COMPUTER SCIENCE, 1999, 223 (1-2) : 73 - 85
  • [28] Sturmian words, Lyndon words and trees
    Berstel, J
    deLuca, A
    THEORETICAL COMPUTER SCIENCE, 1997, 178 (1-2) : 171 - 203
  • [29] Lyndon words and singular factors of sturmian words
    Melançon, G
    THEORETICAL COMPUTER SCIENCE, 1999, 218 (01) : 41 - 59
  • [30] Sturmian words:: Dynamical systems and derivated words
    Araújo, IM
    Bruyère, V
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 122 - 133