Bordered Conjugates of Words over Large Alphabets

被引:0
|
作者
Harju, Tero [1 ]
Nowotka, Dirk [2 ]
机构
[1] Univ Turku, Turku, Finland
[2] Univ Stuttgart, D-7000 Stuttgart, Germany
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2008年 / 15卷 / 01期
关键词
combinatorics on words; border correlation; binary words; square-free; cyclically square-free; Currie set;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The border correlation function attaches to every word w a binary word beta(w) of the same length where ith letter tells whether the ith conjugate w ' = vu of w = uv is bordered or not. Let [u] denote the set of conjugates of word w. We show that for a 3-letter alphabet A, the set of beta-images equals beta(A(n)) B*/([ab(n-1)] UD) where D = {a(n)} if n epsilon {5, 7, 9, 10, 14, 17}, and otherwise D = phi. Hence the number of beta-images is B(3)(n) = 2(n) - n - m, where m = 1 if n epsilon {5, 7, 9, 10, 14, 17} and m = 0 otherwise.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] Smooth words over arbitrary alphabets
    Berthé, V
    Brlek, S
    Choquette, P
    THEORETICAL COMPUTER SCIENCE, 2005, 341 (1-3) : 293 - 310
  • [2] On Generalized Pseudostandard Words Over Binary Alphabets
    Masse, Alexandre Blondin
    Paquin, Genevieve
    Tremblay, Hugo
    Vuillon, Laurent
    JOURNAL OF INTEGER SEQUENCES, 2013, 16 (02)
  • [3] Fully bordered words
    Holub, Stepan
    Mueller, Mike
    THEORETICAL COMPUTER SCIENCE, 2017, 684 : 53 - 58
  • [4] Involutively bordered words
    Kari, Lila
    Mahalingam, Kalpana
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (05) : 1089 - 1106
  • [5] θ - Bordered Infinite Words
    Darshini, C. Annal Deva Priya
    Dare, V. Rajkumar
    PROCEEDINGS OF SEVENTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS (BIC-TA 2012), VOL 2, 2013, 202 : 359 - 365
  • [6] Algorithmics of Posets Generated by Words over Partially Commutative Alphabets
    Mikulski, Lukasz
    Piatkowski, Marcin
    Smyczynski, Sebastian
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2011, 2011, : 209 - 219
  • [7] Universal partial words over non-binary alphabets
    Goeckner, Bennet
    Groothuis, Corbin
    Hettle, Cyrus
    Kell, Brian
    Kirkpatrick, Pamela
    Kirsch, Rachel
    Solava, Ryan
    THEORETICAL COMPUTER SCIENCE, 2018, 713 : 56 - 65
  • [8] On Dejean's conjecture over large alphabets
    Carpi, Arturo
    THEORETICAL COMPUTER SCIENCE, 2007, 385 (1-3) : 137 - 151
  • [9] Algorithms for modeling distributions over large alphabets
    Orlitsky, A
    Sajama
    Santhanam, N
    Viswanathan, K
    Zhang, JN
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 306 - 306
  • [10] Bounds for covering codes over large alphabets
    Kéri, G
    Östergård, PRJ
    DESIGNS CODES AND CRYPTOGRAPHY, 2005, 37 (01) : 45 - 60