Factors and Subwords of Rich Partial Words

被引:0
|
作者
Kumari, R. Krishna [1 ]
Arulprakasam, R. [2 ]
机构
[1] Department of Career Development, SRM Institute of Science and Technology, Tamilnadu, Kattankulathur,Chennai,603203, India
[2] Department of Mathematics, SRM Institute of Science and Technology, Tamilnadu, Kattankulathur,Chennai,603203, India
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Many classes of finite words have noticeable properties with reference to their palindromic factors and one among them are the words having zero palindromic defect i.e., words rich in palindromes. In this paper we introduce rich partial word and discuss its combinatorial properties. We show that the palindromic richness of a partial word can be studied by including the positions of the missing symbols in that word. The significant difference between rich and rich partial word is that a rich word of length n contains exactly n + 1 distinct palindromic factors whereas a rich partial word of length n contains at least n + 1 distinct palindromic factors. These factors differ from the classical palindromes due to the presence of holes © 2023, IAENG International Journal of Applied Mathematics.All Rights Reserved.
引用
收藏
相关论文
共 50 条
  • [31] Primitive partial words
    Blanchet-Sadri, F
    DISCRETE APPLIED MATHEMATICS, 2005, 148 (03) : 195 - 213
  • [32] EQUATIONS ON PARTIAL WORDS
    Blanchet-Sadri, Francine
    Blair, D. Dakota
    Lewis, Rebeca V.
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (01): : 23 - 39
  • [33] On universal partial words
    Chen, Herman Z. Q.
    Kitaev, Sergey
    Muetze, Torsten
    Sun, Brian Y.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2017, 19 (01):
  • [34] Palindromic factorization of rich words
    Rukavicka, Josef
    DISCRETE APPLIED MATHEMATICS, 2022, 316 : 95 - 102
  • [35] Rich, Sturmian, and trapezoidal words
    de Luca, Aldo
    Glen, Amy
    Zamboni, Luca Q.
    THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) : 569 - 573
  • [36] A unique extension of rich words
    Rukavicka, Josef
    THEORETICAL COMPUTER SCIENCE, 2021, 896 (896) : 53 - 64
  • [37] The hardness of counting full words compatible with partial words
    Manea, Florin
    Tiseanu, Catalin
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2013, 79 (01) : 7 - 22
  • [38] FACTORS OF WORDS
    BEAUQUIER, D
    PIN, JE
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 63 - 79
  • [39] The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages
    Rampersad, Narad
    Shallit, Jeffrey
    Xu, Zhi
    FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 223 - 236
  • [40] Abelian repetitions in partial words
    Blanchet-Sadri, F.
    Simmons, Sean
    Xu, Dimin
    ADVANCES IN APPLIED MATHEMATICS, 2012, 48 (01) : 194 - 214