| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10333909 | Theoretical Computer Science | 2011 | 9 Pages |
Abstract
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
L'ubomÃra Balková, Karel BÅinda, OndÅej Turek,