Header menu link for other important links
X
On the least number of palindromes in two-dimensional words
, Palak Pandoh, Kamala Krithivasan
Published in Elsevier B.V.
2019
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. © 2019
About the journal
JournalData powered by TypesetTheoretical Computer Science
PublisherData powered by TypesetElsevier B.V.
ISSN03043975
Open AccessNo
Concepts (9)
  •  related image
    Computational methods
  •  related image
    Computer science
  •  related image
    ALPHABET SIZE
  •  related image
    COMBINATORICS ON WORDS
  •  related image
    FINITE ALPHABET
  •  related image
    NUMBER OF PALINDROMES
  •  related image
    PALINDROMIC
  •  related image
    Sub-arrays
  •  related image
    Linguistics