Can I read On a Class of Infinite Words with Affine Factor Complexity on EtoBox?

On a Class of Infinite Words with Affine Factor Complexity by Bernat, J.; Masáková, Z.; Pelantová, E. is a scholarly article available to read on EtoBox.

What is On a Class of Infinite Words with Affine Factor Complexity about?

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n.

Author

Bernat, J.; Masáková, Z.; Pelantová, E.

Published

2006

Language

EN