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:

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

Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers

Karel Klouda and Edita Pelantová
Integers 9 (3) 281 (2009)
DOI: 10.1515/INTEG.2009.025
See this article

On a class of infinite words with affine factor complexity

Julien Bernat, Zuzana Masáková and Edita Pelantová
Theoretical Computer Science 389 (1-2) 12 (2007)
DOI: 10.1016/j.tcs.2007.07.001
See this article

On β-expansions of unity for rational and transcendental numbers β

Artūras Dubickas
Mathematica Slovaca 61 (5) 705 (2011)
DOI: 10.2478/s12175-011-0040-3
See this article

Factor versus palindromic complexity of uniformly recurrent infinite words

Peter Baláži, Zuzana Masáková and Edita Pelantová
Theoretical Computer Science 380 (3) 266 (2007)
DOI: 10.1016/j.tcs.2007.03.019
See this article

Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers

Ondřej Turek
RAIRO - Theoretical Informatics and Applications 41 (2) 123 (2007)
DOI: 10.1051/ita:2007009
See this article

Corrigendum: Complexity of infinite words associated with beta-expansions

Christiane Frougny, Zuzana Masáková and Edita Pelantová
RAIRO - Theoretical Informatics and Applications 38 (3) 269 (2004)
DOI: 10.1051/ita:2004014
See this article

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)
DOI: 10.1051/ita:2007025
See this article

Symmetrized β -integers

Julien Bernat
Theoretical Computer Science 391 (1-2) 164 (2008)
DOI: 10.1016/j.tcs.2007.10.041
See this article

Sequences with constant number of return words

L’ubomíra Balková, Edita Pelantová and Wolfgang Steiner
Monatshefte für Mathematik 155 (3-4) 251 (2008)
DOI: 10.1007/s00605-008-0001-2
See this article

Developments in Language Theory

Avi Elkharrat and Christiane Frougny
Lecture Notes in Computer Science, Developments in Language Theory 3572 209 (2005)
DOI: 10.1007/11505877_19
See this article

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)
DOI: 10.1051/ita:2008005
See this article