A note on symmetries in the Rauzy graph and factor frequencies
From MaRDI portal
Publication:1029352
DOI10.1016/J.TCS.2009.04.002zbMATH Open1175.68306arXiv0902.0632OpenAlexW1973991916MaRDI QIDQ1029352FDOQ1029352
Authors: L'ubomira Balková, Edita Pelantová 
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0902.0632
Recommendations
- Factor frequencies in languages invariant under symmetries preserving factor frequencies
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- Abelian complexity and frequencies of letters in infinite words
- Publication:4867898
Cites Work
- Palindrome complexity.
- Complexity and special factors
- Title not available (Why is that?)
- A condition for unique ergodicity of minimal symbolic flows
- Factor versus palindromic complexity of uniformly recurrent infinite words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Languages of k -interval exchange transformations
- Substitutions and \(\beta\) systems of numeration
- Title not available (Why is that?)
- Frequencies of factors of Sturmian sequences
- Frequencies of factors in Arnoux–Rauzy sequences
Cited In (1)
This page was built for publication: A note on symmetries in the Rauzy graph and factor frequencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029352)
