On the least number of palindromes in two-dimensional words

Date Issued
06-02-2020
Author(s)
Indian Institute of Technology, Madras
Pandoh, Palak
Krithivasan, Kamala
DOI
Abstract
We investigate the least number of distinct palindromic sub-arrays in two-dimensional words over a finite alphabet Σ={a1,a2⋯,aq} for a given alphabet size q. We discuss the case for both periodic as well as aperiodic words.
Volume
807
Subjects