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
来源：
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | 2018年 / 20卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
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 条
  • [1] Sturmian images of non Sturmian words and standard morphisms
    Seebold, Patrice
    THEORETICAL COMPUTER SCIENCE, 2018, 711 : 92 - 104
  • [2] 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
  • [3] Quasiperiodic Sturmian words and morphisms
    Leve, F.
    Richomme, G.
    THEORETICAL COMPUTER SCIENCE, 2007, 372 (01) : 15 - 25
  • [4] FIBONACCI MORPHISMS AND STURMIAN WORDS
    SEEBOLD, P
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (02) : 365 - 384
  • [5] 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
  • [6] Test-words for Sturmian morphisms
    Richomme, G
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 1999, 6 (04) : 481 - 489
  • [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] On the Lie complexity of Sturmian words
    De Luca, Alessandro
    Fici, Gabriele
    THEORETICAL COMPUTER SCIENCE, 2022, 938 : 81 - 85
  • [10] On the arithmetical complexity of Sturmian words
    Cassaigne, J.
    Frid, A. E.
    THEORETICAL COMPUTER SCIENCE, 2007, 380 (03) : 304 - 316
12345