Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
On the least number of palindromes in two-dimensional words
Kalpana Mahalingam
,
Palak Pandoh
,
Kamala Krithivasan
Published in Elsevier B.V.
2019
DOI:
10.1016/j.tcs.2019.06.030
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
Request full-text
Cite
Content may be subject to copyright.
References (17)
Related Papers (3)
Journal Details
Authors (1)
Concepts (9)
Related Papers (3)
Articles
A branch and bound algorithm to minimize completion time variance on a single processor
2003
Articles
On a class of P automata
2003
Articles
Method to improve geometry for heat transfer enhancement in PCM composite heat sinks
2005
About the journal
Journal
Data powered by Typeset
Theoretical Computer Science
Publisher
Data powered by Typeset
Elsevier B.V.
ISSN
03043975
Open Access
No
Authors (1)
Kalpana Mahalingam
Department of Mathematics
Recent publications
Watson-crick partial words
Two-dimensional palindromes and their properties
Operation Insertion on the Conjugacy and Commutativity of Words
Pictures and Chomsky languages in array P system
Concepts (9)
Computational methods
Computer science
ALPHABET SIZE
COMBINATORICS ON WORDS
FINITE ALPHABET
NUMBER OF PALINDROMES
PALINDROMIC
Sub-arrays
Linguistics
Get all the updates for this publication
Follow