Abelian complexity of infinite words associated with quadratic Parry numbers

Lubomíra Balková, Karel Brinda, Ondrej Turek. Abelian complexity of infinite words associated with quadratic Parry numbers. Theoretical Computer Science, 412(45):6252-6260, 2011. [doi]

Abstract

Abstract is missing.