Factor frequencies in languages invariant under more symmetries

Details Factor frequencies in languages invariant under more symmetries Factor frequencies in languages invariant under more symmetries

2011-07-03

arxiv.org/abs/1107.0471v1

Mathematics

Combinatorics

13 pages

Scientific paper

The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\'a together with the author derived a better upper bound for infinite words whose language is closed under reversal. In this paper, we further diminish the upper bound for uniformly recurrent infinite words whose language is invariant under all elements of a finite group of symmetries and we prove the optimality of the obtained upper bound.

Affiliated with

Also associated with

No associations

Rating

Factor frequencies in languages invariant under more symmetries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Factor frequencies in languages invariant under more symmetries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factor frequencies in languages invariant under more symmetries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707578