A note on symmetries in the Rauzy graph and factor frequencies
From MaRDI portal
(Redirected from Publication:1029352)
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.
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
- scientific article; zbMATH DE number 3153217 (Why is no real title available?)
- scientific article; zbMATH DE number 1234887 (Why is no real title available?)
- scientific article; zbMATH DE number 492720 (Why is no real title available?)
- scientific article; zbMATH DE number 5051582 (Why is no real title available?)
- A condition for unique ergodicity of minimal symbolic flows
- Complexity and special factors
- Factor versus palindromic complexity of uniformly recurrent infinite words
- Frequencies of factors in Arnoux–Rauzy sequences
- Frequencies of factors of Sturmian sequences
- Languages of k -interval exchange transformations
- Palindrome complexity.
- Substitutions and \(\beta\) systems of numeration
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)
