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. 
\v{L}ubom\'ira Balkov\'a, Karel B\v{r}inda, and Ond\v{r}ej Turek
math.CO