68 citations · 285 across the 25 of their papers we have counts for
1 paper · 2 filters
Ľubomíra Balková, Karel Břinda, Ondřej Turek
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.