Citation:
Balková, Ľ., Břinda, K. & Turek, O., 2011. Abelian complexity of infinite words associated with quadratic Parry numbers. Theoretical Computer Science , 412 (45) , pp. 6252–6260. Copy at http://j.mp/2L03H5U
Karel Břinda
Research Associate
CCDD Harvard School of Public Health
DBMI Harvard Medical School
Contact
Contact
Kresge Building, Office 506
677 Huntington Avenue
Boston, MA 02115
kbrinda@hsph.harvard.edu
karel.brinda@hms.harvard.edu
