arXiv Analytics

Sign in

arXiv:0902.0632 [math.CO]AbstractReferencesReviewsResources

A Note on Symmetries in the Rauzy Graph and Factor Frequencies

L. Balkova, E. Pelantova

Published 2009-02-03, updated 2010-09-26Version 2

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 2C(n+1)-2C(n)+1.

Comments: 7 pages
Journal: Theoret. Comput. Sci. 410 (2009), 2779-2783
Categories: math.CO
Subjects: 68R15
Related articles: Most relevant | Search more
arXiv:math/0009094 [math.CO] (Published 2000-09-08)
On the number of return words in infinite words with complexity 2n+1
arXiv:1209.4691 [math.CO] (Published 2012-09-21)
On additive complexity of infinite words
arXiv:math/0611508 [math.CO] (Published 2006-11-16)
Palindromic complexity of infinite words associated with non-simple Parry numbers

Links

Toolbox