Search results

{{Short description|Data structure for processing palindromes}} ...needed to construct the string), and finding and counting all distinct sub-palindromes. Palindrome trees do this in an [[Online algorithm|online]] manner, that is ...

...aximal palindromic substrings (that is, all substrings that are themselves palindromes and cannot be extended to larger palindromic substrings) rather than return ...er|1975}} invented an <math>O(n)</math>-time algorithm for listing all the palindromes that appear at the start of a given string of length <math>n</math>. Howeve ...

[[Category:Palindromes]] ...

...umeral system|base-4 representation]] 101101 are both [[Palindromic number|palindromes]],<ref>{{cite OEIS|A097856|Numbers that are palindromic in bases 2 and 4}}< ...

...achine requires order <math>n^2</math> to recognize the language of binary palindromes in the [[Best, worst and average case|worst case]]. In 1977, W. J. Paul<ref If other palindromes (ending in an accepting state on the left) have the same crossing sequence, ...

* 2009 ''[https://arxiv.org/abs/0909.5452 Palindromes in different bases: A conjecture of J. Ernest Wilkins]''. Integers 9 (2009) ...

...|zbl=1374.68131 |title=EERTREE: An efficient data structure for processing palindromes in strings |date=2018 |last1=Rubinchik |first1=Mikhail |last2=Shur |first2= ...