Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
arXiv:1101.1490 · doi:10.1016/j.tcs.2011.08.016
Abstract
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
12 pages
References in corpus (2)
Cited by in corpus (7)
- On the abelian complexity of the Rudin-Shapiro sequence
- Abelian complexity and Abelian co-decomposition
- On the abelian complexity of generalized Thue-Morse sequences
- Abelian properties of Parry words
- Abelian complexity function of the Tribonacci word
- On the -abelian complexity of the Cantor sequence
- On the additive complexity of a Thue-Morse like sequence