Abelian Complexity and Frequencies of Letters in Infinite Words
Julien Cassaigne, Idrissa Kaboré · International Journal of Foundations of Computer Science · 2016
Abelian complexity in infinite words is a combinatorial tool which developed essentially during the last five years. In this paper, we undertake to establish connections between abelian complexity and uniform frequencies in infinite words. In particular, we focus on the binary case to link uniform equi-frequency with abelian complexity. We also provide various examples of infinite words to illustrate the absence of connection between usual complexity and abelian complexity. Some properties involving uniform recurrence are also given.