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 条
  • [41] LANGUAGES OVER INFINITE ALPHABETS
    AUTEBERT, JM
    BEAUQUIER, J
    BOASSON, L
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 1 - 20
  • [42] Compressing Multisets With Large Alphabets
    Severo, Daniel
    Townsend, James
    Khisti, Ashish
    Makhzani, Alireza
    Ullrich, Karen
    IEEE Journal on Selected Areas in Information Theory, 2022, 3 (04): : 605 - 615
  • [43] Minimax Redundancy for Large Alphabets
    Szpankowski, Wojciech
    Weinberger, Marcelo J.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1488 - 1492
  • [44] On the repetition threshold for large alphabets
    Carpi, Arturo
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 226 - 237
  • [45] The complexity of smooth words on 2-letter alphabets
    Huang, Yun Bao
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6327 - 6339
  • [46] Compressing Multisets with Large Alphabets
    Severo, Daniel
    Townsend, James
    Khisti, Ashish
    Makhzani, Alireza
    Ullrich, Karen
    DCC 2022: 2022 DATA COMPRESSION CONFERENCE (DCC), 2022, : 322 - 331
  • [47] Relative redundancy for large alphabets
    Orlitsky, Alon
    Santhanam, Narayana
    Zhang, Junan
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2672 - +
  • [48] Localisation-Resistant Random Words with Small Alphabets
    Gavoille, Cyril
    Kachigar, Ghazal
    Zemor, Gilles
    COMBINATORICS ON WORDS, WORDS 2019, 2019, 11682 : 193 - 206
  • [49] Cyclically repetition-free words on small alphabets
    Harju, Tero
    Nowotka, Dirk
    INFORMATION PROCESSING LETTERS, 2010, 110 (14-15) : 591 - 595
  • [50] Universal Compression of Memoryless Sources over Large Alphabets via Independent Component Analysis
    Painsky, Amichai
    Rosset, Saharon
    Feder, Meir
    2015 DATA COMPRESSION CONFERENCE (DCC), 2015, : 213 - 222