Abelian complexity of infinite words associated with quadratic Parry numbers

作者：Balkova L'ubomira; Brinda Karel; Turek Ondrej^*

来源：Theoretical Computer Science, 2011, 412(45): 6252-6260.

DOI：10.1016/j.tcs.2011.08.016

• Abelian complexity
• Quadratic Parry numbers
• Binary infinite words

We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.

• 出版日期2011-10-21