Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers

arxiv: 1101.1490 · v1 · pith:46N2GDSKnew · submitted 2011-01-07 · 🧮 math.CO

\v{L}ubom\'ira Balkov\'a , Karel B\v{r}inda , Ond\v{r}ej Turek This is my paper

classification 🧮 math.CO

keywords abelianassociatedcomplexityinfinitenumbersparryquadraticwords

0 comments

read the original abstract

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

This paper has not been read by Pith yet.