Corpus ID: 14788671

Properties of palindromes in finite words

@article{Anisiu2010PropertiesOP,
  title={Properties of palindromes in finite words},
  author={M. Anisiu and Valeriu Anisiu and Z. K{\'a}sa},
  journal={ArXiv},
  year={2010},
  volume={abs/1002.2723}
}
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length n + 1 from the set of palindromes of length n. We show that the palindrome complexity function, which counts the number of palindromes of each length contained in a given word, has a dierent shape compared with the usual (subword) complexity function. We give upper bounds for the average number of palindromes contained… Expand
3 Citations
Total palindrome complexity of finite words
  • 15
Two-dimensional Total Palindrome Complexity
  • 1

References

SHOWING 1-10 OF 27 REFERENCES
Palindrome complexity
  • 116
  • PDF
Combinatorial Properties of Sturmian Palindromes
  • 21
A generalized recursive construction for de Bruijn sequences
  • R. Games
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1983
  • 27
A New Memoryless Algorithm for De Bruijn Sequences
  • 34
On the Combinatorics of Finite Words
  • A. Luca
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1999
  • 92
Palindromic factors of billiard words
  • 25
A problem in arrangements
  • 63
  • PDF
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
  • 384
  • PDF
Palindromes in Proteins
  • 19
...
1
2
3
...