Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
math.CO↗
arXiv subjects
Publications and source records attributed to Ľubomíra Balková.
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.