Abstract
We investigate the maximum number of distinct palindromic sub-arrays in a two-dimensional finite word over a finite alphabet (Formula Presented). For any finite array in (Formula Presented), we find an upper bound for the number of distinct palindromic sub-arrays and improve it by giving a tight bound on the maximum number of distinct palindromes in an array in (Formula Presented) for (Formula Presented). We then, propose a better upper bound for any finite array in(Formula Presented).
Author supplied keywords
Cite
CITATION STYLE
Mahalingam, K., & Pandoh, P. (2019). On the Maximum Number of Distinct Palindromic Sub-arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11417 LNCS, pp. 434–446). Springer Verlag. https://doi.org/10.1007/978-3-030-13435-8_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
