A Note on Symmetries in the Rauzy Graph and Factor Frequencies
Combinatorics
2013-02-12 v2
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 2C(n+1)-2C(n)+1.
Cite
@article{arxiv.0902.0632,
title = {A Note on Symmetries in the Rauzy Graph and Factor Frequencies},
author = {L. Balkova and E. Pelantova},
journal= {arXiv preprint arXiv:0902.0632},
year = {2013}
}
Comments
7 pages