HV-Palindromes in Two-Dimensional Words

DOI10.1142/s012905412250006xarXiv1904.11334OpenAlexW4214506306MaRDI QIDQ6114875

Palak Pandoh, Kalpana Mahalingam

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodicity in rectangular arrays
• On the least number of palindromes contained in an infinite word
• Palindromic richness
• Total palindrome complexity of finite words
• The derivation of on-line algorithms, with an application to finding palindromes
• Finding maximal 2-dimensional palindromes
• Palindrome complexity.
• Theta palindromes in theta conjugates
• On the maximum number of distinct palindromic sub-arrays
• On the least number of palindromes in two-dimensional words
• Coverability and multi-scale coverability on infinite pictures
• Pseudopalindrome closure operators in free monoids
• Two-Dimensional Periodicity in Rectangular Arrays
• Periods and borders of random words
• Watson-Crick Conjugate and Commutative Words
• Two-Dimensional Palindromes and Their Properties
• Watson-Crick palindromes in DNA computing