Article ID Journal Published Year Pages File Type
436586 Theoretical Computer Science 2008 7 Pages PDF
Abstract

Let pi(n) denote the number of the C∞-words of form  with length 2n+i and gap i, where i is the length of word x. In this paper, we prove the following result: pi(n)=6 for all n≥1 and i=2,3,4. Moreover, we provide a complete solution of for |x|≤4.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics