Citation:
Balková, Ľ., Břinda, K., & Turek, O. (2011). Abelian complexity of infinite words associated with quadratic Parry numbers. Theoretical Computer Science , 412 (45), 6252–6260. Copy at https://j.mp/2L03H5U
Karel Břinda, Ph.D.
Postdoctoral Researcher
Department of Biomedical Informatics
Harvard Medical School
Contact
Countway 3rd floor
10 Shattuck St.
Boston, MA 02115
karel.brinda@hms.harvard.edu
