112 citations · 167 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2013★ 5 cited
Balances of -bonacci words
Karel Břinda, Edita Pelantová, Ondřej Turek
The -bonacci word is a generalization of the Fibonacci word to the -letter alphabet . It is the unique fixed point of the Pisot--type substitution…
math.CO2011★ 16 cited
Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
Ľ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.