112 research outputs found
A note on palindromicity
Two results on palindromicity of bi-infinite words in a finite alphabet are
presented. The first is a simple, but efficient criterion to exclude
palindromicity of minimal sequences and applies, in particular, to the
Rudin-Shapiro sequence. The second provides a constructive method to build
palindromic minimal sequences based upon regular, generic model sets with
centro-symmetric window. These give rise to diagonal tight-binding models in
one dimension with purely singular continuous spectrum.Comment: 12 page
The Palindrome Concept and Its Applications to Prime Numbers
This article originates from a proposal by M. L. Perez of American Research Press to carry out a study on Smarandache generalized palindromes [1]. The prime numbers were chosen as a rst set of numbers to apply the development of ideas and computer programs on. The study begins by exploring regular prime number palindromes. To continue the study it proved useful to introduce a new concept, that of extended palindromes with the property that the union of regular palindromes and extended palindromes form the set of Smarandache
generalized palindromes. An interesting observation is proved in the article, namely that the only regular prime number palindrome with an even number of digits is 11
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
We propose a new linear-size data structure which provides a fast access to
all palindromic substrings of a string or a set of strings. This structure
inherits some ideas from the construction of both the suffix trie and suffix
tree. Using this structure, we present simple and efficient solutions for a
number of problems involving palindromes.Comment: 21 pages, 2 figures. Accepted to IWOCA 201
PalFM-Index: FM-Index for Palindrome Pattern Matching
n} in the preprocessing phase
- …