On the maximum number of distinct palindromic sub-arrays

DOI10.1007/978-3-030-13435-8_32zbMATH Open1425.68333DBLPconf/lata/MahalingamP19OpenAlexW2914316835WikidataQ62046569 ScholiaQ62046569MaRDI QIDQ2278298FDOQ2278298

Authors: Kalpana Mahalingam, Palak Pandoh 

Publication date: 4 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_32

Recommendations

• Enumeration of two dimensional palindromes
• On the least number of palindromes in two-dimensional words
• Two-dimensional palindromes and their properties
• Finding maximal 2-dimensional palindromes
• scientific article; zbMATH DE number 5501412

zbMATH Keywords

combinatorics on wordstwo-dimensional words2D palindromesmaximum palindromes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (5)

• Enumeration of two dimensional palindromes
• On the least number of palindromes in two-dimensional words
• Two-dimensional palindromes and their properties
• HV-Palindromes in Two-Dimensional Words
• 2-dimensional palindromes with \(k\) mismatches

This page was built for publication: On the maximum number of distinct palindromic sub-arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278298)