Powers in a class of A-strict standard episturmian words

被引:10
|
作者
Glen, Amy [1 ]
机构
[1] Univ Quebec, LaCIM, Montreal, PQ H3C 3P8, Canada
关键词
episturmian word; Sturmian word; Arnoux-Rauzy sequence; k-bonacci word; singular word; index; powers;
D O I
10.1016/j.tcs.2007.03.023
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz [D. Damanik, D. Lenz, Powers in Sturmian sequences, European J. Combin. 24 (2003) 377-390, doi:10.1016/S0195-6698(03)00026-X], who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a generalization of singular words, which were originally defined for the ubiquitous Fibonacci word. Our main results are demonstrated via some examples, including the k-bonacci word, a generalization of the Fibonacci word to a k-letter alphabet (k >= 2). (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:330 / 354
页数:25
相关论文
共 11 条
  • [1] Episturmian words and episturmian morphisms
    Justin, J
    Pirillo, G
    THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 281 - 313
  • [2] DIRECTIVE WORDS OF EPISTURMIAN WORDS: EQUIVALENCES AND NORMALIZATION
    Glen, Amy
    Leve, Florence
    Richomme, Gwenael
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (02): : 299 - 319
  • [3] On θ-episturmian words
    Bucci, Michelangelo
    de Luca, Aldo
    De Luca, Alessandro
    Zamboni, Luca Q.
    EUROPEAN JOURNAL OF COMBINATORICS, 2009, 30 (02) : 473 - 479
  • [4] Quasiperiodic and Lyndon episturmian words
    Glen, Amy
    Leve, Florence
    Richomme, Gwenael
    THEORETICAL COMPUTER SCIENCE, 2008, 409 (03) : 578 - 600
  • [5] Palindromic prefixes and episturmian words
    Fischler, Stephane
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (07) : 1281 - 1304
  • [6] EPISTURMIAN WORDS: A SURVEY
    Glen, Amy
    Justin, Jacques
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (03): : 403 - 442
  • [7] Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
    Peltomaki, Jarkko
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 118
  • [8] Fractional powers in Sturmian words
    Justin, J
    Pirillo, G
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 363 - 376
  • [9] Abelian powers and repetitions in Sturmian words
    Fici, Gabriele
    Langiu, Alessio
    Lecroq, Thierry
    Lefebvre, Arnaud
    Mignosi, Filippo
    Peltomaki, Jarkko
    Prieur-Gaston, Elise
    THEORETICAL COMPUTER SCIENCE, 2016, 635 : 16 - 34
  • [10] Standard words and solutions of the word equation X12 ... Xn2 = (X1 ... Xn)2
    Peltomaki, Jarkko
    Saarela, Aleksi
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2021, 178