Abelian complexity and Abelian co-decomposition

Ondřej Turek

We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique…