On the least number of palindromes in two-dimensional words

DOI10.1016/j.tcs.2019.06.030zbMath1456.68137OpenAlexW2960471626WikidataQ127471245 ScholiaQ127471245MaRDI QIDQ2286748

Palak Pandoh, Kamala Krithivasan, Kalpana Mahalingam

Publication date: 22 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.030

zbMATH Keywords

combinatorics on wordstwo-dimensional wordsnumber of palindromes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Enumeration of two dimensional palindromes, HV-Palindromes in Two-Dimensional Words, Rich words in the block reversal of a word

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
• Total palindrome complexity of finite words
• Subword complexities of various classes of deterministic developmental languages without interactions
• Uniformly growing k-th power-free homomorphisms
• Palindrome complexity.
• On a conjecture on bidimensional words.
• Palindromes and Sturmian words
• On the maximum number of distinct palindromic sub-arrays
• Two-Dimensional Periodicity in Rectangular Arrays
• Two-Dimensional Palindromes and Their Properties