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 条
  • [31] Bifix codes and Sturmian words
    Berstel, Jean
    De Felice, Clelia
    Perrin, Dominique
    Reutenauer, Christophe
    Rindone, Giuseppina
    JOURNAL OF ALGEBRA, 2012, 369 : 146 - 202
  • [32] On the permutations generated by Sturmian words
    M. A. Makarov
    Siberian Mathematical Journal, 2009, 50 : 674 - 680
  • [33] Rich, Sturmian, and trapezoidal words
    de Luca, Aldo
    Glen, Amy
    Zamboni, Luca Q.
    THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) : 569 - 573
  • [34] Abelian returns in Sturmian words
    Puzynina, Svetlana
    Zamboni, Luca Q.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (02) : 390 - 408
  • [35] The number of runs in Sturmian words
    Baturo, Pawel
    Pitakowski, Marcin
    Rytter, Wojciech
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 252 - 261
  • [36] The Number of Cubes in Sturmian Words
    Piatkowski, Marcin
    Rytter, Wojciech
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 89 - 102
  • [37] STANDARD FACTORS OF STURMIAN WORDS
    Richomme, Gwenael
    Saari, Kalle
    Zamboni, Luca Q.
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2010, 44 (01): : 159 - 174
  • [38] A Characterization of Bispecial Sturmian Words
    Fici, Gabriele
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 383 - 394
  • [39] On Minimal Sturmian Partial Words
    Blanchet-Sadri, Francine
    Lensmire, John
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 225 - 236
  • [40] Lyndon factorization of sturmian words
    Melançon, G
    DISCRETE MATHEMATICS, 2000, 210 (1-3) : 137 - 149