排序方式: 共有1条查询结果,搜索用时 31 毫秒
1
1.
The palindrome complexity function palw of a word w attaches to each n∈N the number of palindromes (factors equal to their mirror images) of length n contained in w. The number of all the nonempty palindromes in a finite word is called the total palindrome complexity of that word. We present exact bounds for the total palindrome complexity and construct words which have any palindrome complexity between these bounds, for binary alphabets as well as for alphabets with the cardinal greater than 2. Denoting by Mq(n) the average number of palindromes in all words of length n over an alphabet with q letters, we present an upper bound for Mq(n) and prove that the limit of Mq(n)/n is 0. A more elaborate estimation leads to . 相似文献
1