HV-Palindromes in Two-Dimensional Words

DOI10.1142/S012905412250006XMaRDI QIDQ6114875zbMATH OpenOpenAlexFDO

Authors Kalpana Mahalingam, Palak Pandoh

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.11334

zbMATH Keywords

combinatorics on wordstwo-dimensional wordsproperties of palindromes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: A two-dimensional ($2$D) word is a $2$D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are $1$D palindromes. We study some combinatorial and structural properties of HV-palindromes and its comparison with $2$D palindromes. We investigate the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite $2$D word, thus, proving the conjecture given by Anisiua et al. We also find the least number of HV-palindromes in an infinite $2$D word over a finite alphabet size $q$.

Recommendations

• Two-dimensional palindromes and their properties
• Enumeration of two dimensional palindromes
• On the least number of palindromes in two-dimensional words
• scientific article; zbMATH DE number 5501412
• On the maximum number of distinct palindromic sub-arrays

Cites work

• scientific article; zbMATH DE number 5501412 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Coverability and multi-scale coverability on infinite pictures
• Finding maximal 2-dimensional palindromes
• On the least number of palindromes contained in an infinite word
• On the least number of palindromes in two-dimensional words
• On the maximum number of distinct palindromic sub-arrays
• Palindrome complexity.
• Palindromes and two-dimensional Sturmian sequences
• Palindromic richness
• Periodicity in rectangular arrays
• Periods and borders of random words
• Pseudopalindrome closure operators in free monoids
• The derivation of on-line algorithms, with an application to finding palindromes
• Theta palindromes in theta conjugates
• Total palindrome complexity of finite words
• Two-Dimensional Periodicity in Rectangular Arrays
• Two-dimensional palindromes and their properties
• Watson-Crick Conjugate and Commutative Words
• Watson-Crick palindromes in DNA computing

Cited in

(2)

• From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
• 2-dimensional palindromes with \(k\) mismatches

This page was built for publication: HV-Palindromes in Two-Dimensional Words

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