Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words

Ondřej Turek

RAIRO-Theor. Inf. Appl., 44 3 (2010) 313-337

Published online: 2010-07-20

DOI: https://doi.org/10.1051/ita/2010017

This article has been cited by the following article(s):

Sturmian jungle (or garden?) on multiliteral alphabets

L'ubomíra Balková, Edita Pelantová and Štěpán Starosta
RAIRO - Theoretical Informatics and Applications 44 (4) 443 (2010)
DOI: 10.1051/ita/2011002
See this article

Abelian properties of Parry words

Ondřej Turek
Theoretical Computer Science 566 26 (2015)
DOI: 10.1016/j.tcs.2014.11.024
See this article

Abelian complexity of infinite words associated with quadratic Parry numbers

L’ubomíra Balková, Karel Břinda and Ondřej Turek
Theoretical Computer Science 412 (45) 6252 (2011)
DOI: 10.1016/j.tcs.2011.08.016
See this article

Abelian complexity and abelian co-decomposition

Ondřej Turek
Theoretical Computer Science 469 77 (2013)
DOI: 10.1016/j.tcs.2012.10.034
See this article

The abelian complexity of the paperfolding word

Blake Madill and Narad Rampersad
Discrete Mathematics 313 (7) 831 (2013)
DOI: 10.1016/j.disc.2013.01.005
See this article

AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY

JULIEN CASSAIGNE, GWÉNAËL RICHOMME, KALLE SAARI and LUCA Q. ZAMBONI
International Journal of Foundations of Computer Science 22 (04) 905 (2011)
DOI: 10.1142/S0129054111008489
See this article