| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438049 | Theoretical Computer Science | 2009 | 5 Pages |
Abstract
We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2ΔC(n)+1, where ΔC(n) is the first difference of factor complexity C(n) of the infinite word.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
