Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Counting scattered palindromes in a finite word
Kalpana Mahalingam, Palak Pandoh
We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an u…
cs.DM2019
Palindromes in two-dimensional Words
Kalpana Mahalingam, Palak Pandoh
A two-dimensional (D) word is a D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are D palindromes. We study some combinat…