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 条
  • [1] Words and morphisms with Sturmian erasures
    Durand, F
    Guerziz, A
    Koskas, M
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2004, 11 (04) : 575 - 588
  • [2] Quasiperiodic Sturmian words and morphisms
    Leve, F.
    Richomme, G.
    THEORETICAL COMPUTER SCIENCE, 2007, 372 (01) : 15 - 25
  • [3] Sturmian images of non Sturmian words and standard morphisms
    Seebold, Patrice
    THEORETICAL COMPUTER SCIENCE, 2018, 711 : 92 - 104
  • [4] On an involution of Christoffel words and Sturmian morphisms
    Berthe, Valerie
    de Luca, Aldo
    Reutenauer, Christophe
    EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (02) : 535 - 553
  • [5] Test-words for Sturmian morphisms
    Richomme, G
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 1999, 6 (04) : 481 - 489
  • [6] Some Recent Results of Fibonacci Numbers, Fibonacci Words and Sturmian Words
    Pirillo, G.
    SOUTHEAST ASIAN BULLETIN OF MATHEMATICS, 2019, 43 (02) : 273 - 286
  • [7] Fixed points of Sturmian morphisms and their derivated words
    Klouda, Karel
    Medkova, Katerina
    Pelantova, Edita
    Starosta, Stepan
    THEORETICAL COMPUTER SCIENCE, 2018, 743 : 23 - 37
  • [8] Conjugates of characteristic Sturmian words generated by morphisms
    Glen, A
    EUROPEAN JOURNAL OF COMBINATORICS, 2004, 25 (07) : 1025 - 1037
  • [9] INFINITE FIBONACCI WORDS AND ITERATED MORPHISMS
    PANSIOT, JJ
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1983, 17 (02): : 131 - 135
  • [10] Permutation complexity of images of Sturmian words by marked morphisms
    Borchert, Adam
    Rampersad, Narad
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (01):
12345