Recurrent words with constant Abelian complexity

James D. Currie, Narad Rampersad. Recurrent words with constant Abelian complexity. Adv. Appl. Math., 47(1):116-124, 2011. [doi]

@article{CurrieR11-0,
  title = {Recurrent words with constant Abelian complexity},
  author = {James D. Currie and Narad Rampersad},
  year = {2011},
  doi = {10.1016/j.aam.2010.05.001},
  url = {https://doi.org/10.1016/j.aam.2010.05.001},
  researchr = {https://researchr.org/publication/CurrieR11-0},
  cites = {0},
  citedby = {0},
  journal = {Adv. Appl. Math.},
  volume = {47},
  number = {1},
  pages = {116-124},
}