Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]