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 条
  • [21] Words, Subwords, and Morphemes: What Really Matters in the Surprisal-Reading Time Relationship?
    Nair, Sathvik
    Resnik, Philip
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (EMNLP 2023), 2023, : 11251 - 11260
  • [22] On the Number of Rich Words
    Rukavicka, Josef
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 345 - 352
  • [23] Extensions of rich words
    Vesti, Jetro
    THEORETICAL COMPUTER SCIENCE, 2014, 548 : 14 - 24
  • [24] Periodicity on partial words
    Blanchet-Sadri, F
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2004, 47 (01) : 71 - 82
  • [25] Squares in partial words
    Blanchet-Sadri, F.
    Jiao, Yang
    Machacek, John M.
    Quigley, J. D.
    Zhang, Xufan
    THEORETICAL COMPUTER SCIENCE, 2014, 530 : 42 - 57
  • [26] On the periods of partial words
    Shur, AM
    Konovalova, YV
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 657 - 665
  • [27] Freeness of partial words
    Manea, Florin
    Mercas, Robert
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 265 - 277
  • [28] Unbordered partial words
    Blanchet-Sadri, F.
    Davis, C. D.
    Dodge, Joel
    Mercas, Robert
    Moorefield, Margaret
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 890 - 900
  • [29] Equations on partial words
    Blanchet-Sadri, F.
    Blair, D. Dakota
    Lewis, Rebeca V.
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 167 - 178
  • [30] Conjugacy on partial words
    Blanchet-Sadri, F
    Luhmann, DK
    THEORETICAL COMPUTER SCIENCE, 2002, 289 (01) : 297 - 312