Citation:
Ľ. Balková, K. Břinda, and O. Turek, “Abelian complexity of infinite words associated with quadratic Parry numbers,” Theoretical Computer Science, vol. 412, no. 45, pp. 6252–6260, 2011. 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
