SUBWORD COMPLEXITY OF A GENERALIZED THUE-MORSE WORD

被引:10
|
作者
TROMP, J [1 ]
SHALLIT, J [1 ]
机构
[1] UNIV WATERLOO,DEPT COMP SCI,WATERLOO,ON N2L 3G1,CANADA
基金
加拿大自然科学与工程研究理事会;
关键词
FORMAL LANGUAGES; SUBWORD COMPLEXITY; THUE-MORSE WORD;
D O I
10.1016/0020-0190(95)00074-M
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Let y = y(0)y(1)y(2) ... be an infinite word over a finite alphabet, and let p(y)(r) count the number of distinct subwords of y of length r. In this paper we determine p(y)(r) when y(i) = s2(i) mod k, where s2(i) denotes the sum of the base-2 digits of i. Our method is based on determining the redundancy of a certain code for subwords of a related infinite word.
引用
收藏
页码:313 / 316
页数:4
相关论文
共 50 条
  • [1] On the subword complexity of Thue-Morse polynomial extractions
    Moshe, Yossi
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 318 - 329
  • [2] The subword complexity of polynomial subsequences of the Thue-Morse sequence
    Shen, Zhao
    [J]. COMPTES RENDUS MATHEMATIQUE, 2022, 360 (01) : 503 - 511
  • [3] Permutation complexity of the Thue-Morse word
    Widmer, Steven
    [J]. ADVANCES IN APPLIED MATHEMATICS, 2011, 47 (02) : 309 - 329
  • [4] On Arithmetic Progressions in the Generalized Thue-Morse Word
    Parshina, Olga G.
    [J]. COMBINATORICS ON WORDS, WORDS 2015, 2015, 9304 : 191 - 196
  • [5] On the abelian complexity of generalized Thue-Morse sequences
    Chen, Jin
    Wen, Zhi-Xiong
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 780 : 66 - 73
  • [6] On the 2-abelian complexity of the Thue-Morse word
    Greinecker, Florian
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 593 : 88 - 105
  • [7] On the powers in the Thue-Morse word
    Aberkane, A.
    Linek, V.
    Mor, S. J.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2006, 35 : 41 - 49
  • [8] GAPS IN THE THUE-MORSE WORD
    Spiegelhofer, Lukas
    [J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2023, 114 (01) : 110 - 144
  • [9] Computing the k-binomial complexity of the Thue-Morse word
    Lejeune, Marie
    Leroy, Julien
    Rigo, Michel
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2020, 176
  • [10] Computing the k-binomial Complexity of the Thue-Morse Word
    Lejeune, Marie
    Leroy, Julien
    Rigo, Michel
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2019, 2019, 11647 : 278 - 291