On the abelian complexity of generalized Thue-Morse sequences
Combinatorics
2019-04-11 v2
Abstract
In this paper, we study the abelian complexity of generalized Thue-Morse sequences . We obtain the exact value of for every integer . Consequently, is ultimately periodic with the period . Moreover, we show that the abelian complexities of a class of infinite sequences are -automatic.
Cite
@article{arxiv.1809.06554,
title = {On the abelian complexity of generalized Thue-Morse sequences},
author = {Jin Chen and Zhi-Xiong Wen},
journal= {arXiv preprint arXiv:1809.06554},
year = {2019}
}