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]
@article{BalkovaBT11,
title = {Abelian complexity of infinite words associated with quadratic Parry numbers},
author = {Lubomíra Balková and Karel Brinda and Ondrej Turek},
year = {2011},
doi = {10.1016/j.tcs.2011.08.016},
url = {http://dx.doi.org/10.1016/j.tcs.2011.08.016},
researchr = {https://researchr.org/publication/BalkovaBT11},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {412},
number = {45},
pages = {6252-6260},
}