当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the least number of palindromes in two-dimensional words
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2019-07-16 , DOI: 10.1016/j.tcs.2019.06.030 Kalpana Mahalingam , Palak Pandoh , Kamala Krithivasan
中文翻译:
关于二维单词中最少的回文数
更新日期:2019-07-16
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2019-07-16 , DOI: 10.1016/j.tcs.2019.06.030 Kalpana Mahalingam , Palak Pandoh , Kamala Krithivasan
We investigate the least number of distinct palindromic sub-arrays in two-dimensional words over a finite alphabet for a given alphabet size q. We discuss the case for both periodic as well as aperiodic words.
中文翻译:
关于二维单词中最少的回文数
我们在有限字母上的二维单词中研究最少数量的不同回文子数组 对于给定的字母大小q。我们讨论周期词和非周期词的情况。