Note: About the number of C∞-words of form~wxw

Authors:
Y. B. Huang
Affiliations:
Department of Mathematics, Hangzhou Normal University, Xiasha Economic Development Area, Hangzhou, Zhejiang 310036, China
Venue:
Theoretical Computer Science
Year:
2008

Citing 5
Cited 3

Palindromes in the Fibonacci word

Information Processing Letters
Palindromes and Sturmian words

Theoretical Computer Science
Palindrome complexity bounds for primitive substitution sequences

Discrete Mathematics
Palindrome complexity

Theoretical Computer Science
A note on differentiable palindromes

Theoretical Computer Science

The complexity of Cbw-words of the form w×w

Theoretical Computer Science
A note on the complexity of C∞-words

Theoretical Computer Science
The complexity of smooth words on 2-letter alphabets

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Let p"i(n) denote the number of the C^~-words of form w@?xw with length 2n+i and gap i, where i is the length of word x. In this paper, we prove the following result: p"i(n)=6 for all n=1 and i=2,3,4. Moreover, we provide a complete solution of w@?xw@?C^b^@w for |x|@?4.