Recurrent words with constant Abelian complexity
arXiv:0911.5151
Abstract
We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al.
arXiv:0911.5151
We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al.