Upper bound for palindromic and factor complexity of rich words

被引：0
|
作者：
Rukavicka, Josef [1 ]
机构：
[1] Department of Mathematics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Prague,166 36-6, Czech Republic
来源：
RAIRO - Theoretical Informatics and Applications | 2021年 / 55卷
关键词：
Acknowledgements. The author wishes to thank to Sˇtˇepán Starosta for his useful comments. The author acknowledges support by the Czech Science Foundation grant GACˇR 13-03538S and by the Grant Agency of the Czech Technical University in Prague; grant No. SGS14/205/OHK4/3T/14;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
19
引用
收藏
相关论文
共 50 条
  • [1] UPPER BOUND FOR PALINDROMIC AND FACTOR COMPLEXITY OF RICH WORDS
    Rukavicka, Josef
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2021, 55
  • [2] On the palindromic complexity of infinite words
    Brlek, S
    Hamel, S
    Nivat, M
    Reutenauer, C
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (02) : 293 - 306
  • [3] A connection between palindromic and factor complexity using return words
    Bucci, Michelangelo
    De Luca, Alessandro
    Glen, Amy
    Zamboni, Luca Q.
    ADVANCES IN APPLIED MATHEMATICS, 2009, 42 (01) : 60 - 74
  • [4] Factor versus palindromic complexity of uniformly recurrent infinite words
    Balazi, Peter
    Masakova, Zuzana
    Pelantova, Edita
    THEORETICAL COMPUTER SCIENCE, 2007, 380 (03) : 266 - 275
  • [5] Palindromic factorization of rich words
    Rukavicka, Josef
    DISCRETE APPLIED MATHEMATICS, 2022, 316 : 95 - 102
  • [6] Complexity and palindromic defect of infinite words
    Brlek, S.
    Reutenauer, C.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 493 - 497
  • [7] Palindromic rich words and run-length encodings
    Guo, Chuan
    Shallit, Jeffrey
    Shur, Arseny M.
    INFORMATION PROCESSING LETTERS, 2016, 116 (12) : 735 - 738
  • [8] Palindromic complexity of infinite words associated with simple Parry numbers
    Ambroz, Petr
    Masakova, Zuzana
    Pelantova, Edita
    Frougny, Christiane
    ANNALES DE L INSTITUT FOURIER, 2006, 56 (07) : 2131 - 2160
  • [9] An upper bound for topological complexity
    Farber, Michael
    Grant, Mark
    Lupton, Gregory
    Oprea, John
    TOPOLOGY AND ITS APPLICATIONS, 2019, 255 : 109 - 125
  • [10] On the Upper Bound of the Complexity of Sorting
    I. S. Sergeev
    Computational Mathematics and Mathematical Physics, 2021, 61 : 329 - 346
12345