Permutation complexity of images of Sturmian words by marked morphisms

被引:0
|
作者
Borchert, Adam [1 ]
Rampersad, Narad [1 ]
机构
[1] Univ Winnipeg, Dept Math & Stat, Winnipeg, MB, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
permutation complexity; Sturmian words; morphisms;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is n + k for some constant k and all lengths n sufficiently large.
引用
收藏
页数:9
相关论文
共 50 条
  • [41] On the permutations generated by Sturmian words
    M. A. Makarov
    Siberian Mathematical Journal, 2009, 50 : 674 - 680
  • [42] The Number of Cubes in Sturmian Words
    Piatkowski, Marcin
    Rytter, Wojciech
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 89 - 102
  • [43] The number of runs in Sturmian words
    Baturo, Pawel
    Pitakowski, Marcin
    Rytter, Wojciech
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 252 - 261
  • [44] STANDARD FACTORS OF STURMIAN WORDS
    Richomme, Gwenael
    Saari, Kalle
    Zamboni, Luca Q.
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2010, 44 (01): : 159 - 174
  • [45] Abelian returns in Sturmian words
    Puzynina, Svetlana
    Zamboni, Luca Q.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (02) : 390 - 408
  • [46] A Characterization of Bispecial Sturmian Words
    Fici, Gabriele
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 383 - 394
  • [47] 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
  • [48] Lyndon factorization of sturmian words
    Melançon, G
    DISCRETE MATHEMATICS, 2000, 210 (1-3) : 137 - 149
  • [49] Sturmian words and the Stern sequence
    de Luca, Aldo
    De Luca, Alessandro
    THEORETICAL COMPUTER SCIENCE, 2015, 581 : 26 - 44
  • [50] Generalized balances in Sturmian words
    Fagnot, I
    Vuillon, L
    DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 83 - 101