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:
Ondřej Turek
RAIRO-Theor. Inf. Appl., 41 2 (2007) 123-135
Published online: 2007-07-18
This article has been cited by the following article(s):
7 articles
Generalizations of Sturmian sequences associated with -continued fraction algorithms
Niels Langeveld, Lucía Rossi and Jörg M. Thuswaldner Journal of Number Theory 250 49 (2023) https://doi.org/10.1016/j.jnt.2023.03.008
Abelian properties of Parry words
Ondřej Turek Theoretical Computer Science 566 26 (2015) https://doi.org/10.1016/j.tcs.2014.11.024
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) https://doi.org/10.1016/j.tcs.2011.08.016
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) https://doi.org/10.1051/ita/2011002
Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
Ondřej Turek RAIRO - Theoretical Informatics and Applications 44 (3) 313 (2010) https://doi.org/10.1051/ita/2010017
Palindromic complexity of infinite words associated with non-simple Parry numbers
L'ubomíra Balková and Zuzana Masáková RAIRO - Theoretical Informatics and Applications 43 (1) 145 (2009) https://doi.org/10.1051/ita:2008005
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
Lubomíra Balková, Edita Pelantová and Ondřej Turek RAIRO - Theoretical Informatics and Applications 41 (3) 307 (2007) https://doi.org/10.1051/ita:2007025