Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers

Ľubomíra Balková; Karel Břinda; Ondřej Turek

doi:10.1016/j.tcs.2011.08.016

Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers

Combinatorics 2011-09-27 v1

Authors: Ľubomíra Balková , Karel Břinda , Ondřej Turek

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.

Keywords

abelian complexity infinite words quadratic parry numbers combinatorics on words

Cite

@article{arxiv.1101.1490,
  title  = {Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers},
  author = {Ľubomíra Balková and Karel Břinda and Ondřej Turek},
  journal= {arXiv preprint arXiv:1101.1490},
  year   = {2011}
}