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 条
  • [21] On a faithful representation of Sturmian morphisms
    Lepsova, Jana
    Pelantova, Edita
    Starosta, Stepan
    EUROPEAN JOURNAL OF COMBINATORICS, 2023, 110
  • [22] Permutation complexity of the fixed points of some uniform binary morphisms
    Valyuzhenich, Alexander
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 257 - 264
  • [23] ON PERMUTATION COMPLEXITY OF FIXED POINTS OF SOME NONUNIFORM BINARY MORPHISMS
    Valuzhenich, A. A.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2015, 12 : 64 - 79
  • [24] On permutation complexity of fixed points of some uniform binary morphisms
    Valyuzhenich, Alexandr
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (03): : 95 - 128
  • [25] Sturmian morphisms, the braid group B4, Christoffel words and bases of F2
    Kassel, Christian
    Reutenauer, Christophe
    ANNALI DI MATEMATICA PURA ED APPLICATA, 2007, 186 (02) : 317 - 339
  • [26] Sturmian morphisms, the braid group B4, Christoffel words and bases of F2
    Christian Kassel
    Christophe Reutenauer
    Annali di Matematica Pura ed Applicata, 2007, 186 : 317 - 339
  • [27] Return words in Sturmian and Episturmian words
    Justin, J
    Vuillon, L
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (05): : 343 - 356
  • [28] Palindromes in Sturmian words
    de Luca, A
    De Luca, A
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 199 - 208
  • [29] DECIDABILITY FOR STURMIAN WORDS
    Hieronymi, Philipp
    Ma, Dun
    Oei, Reed
    Schaeffer, Luke
    Schulz, Chris
    Shallit, Jeffrey
    LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 20 (03)
  • [30] Decimations and Sturmian words
    Justin, J
    Pirillo, G
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (03): : 271 - 290
12345