Complexity of infinite words associated with beta-expansions
RAIRO-Theor. Inf. Appl., 38 2 (2004) 163-185
Published online: 2004-06-15
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):
Substitutions and Cantor real numeration systems
É. Charlier, C. Cisternino, Z. Masáková and E. PelantováActa Mathematica Hungarica 176 (1) 15 (2025)
https://doi.org/10.1007/s10474-025-01535-1
String Attractors of Some Simple-Parry Automatic Sequences
France Gheeraert, Giuseppe Romana and Manon StipulantiTheory of Computing Systems 68 (6) 1601 (2024)
https://doi.org/10.1007/s00224-024-10195-7
Generalizations of Sturmian sequences associated with -continued fraction algorithms
Niels Langeveld, Lucía Rossi and Jörg M. ThuswaldnerJournal of Number Theory 250 49 (2023)
https://doi.org/10.1016/j.jnt.2023.03.008
On β-expansions of unity for rational and transcendental numbers β
Artūras DubickasMathematica Slovaca 61 (5) 705 (2011)
https://doi.org/10.2478/s12175-011-0040-3
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
Roots of Polynomials of Bounded Height
Paulius Drungilas and Artūras DubickasRocky Mountain Journal of Mathematics 39 (2) (2009)
https://doi.org/10.1216/RMJ-2009-39-2-527
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
Karel Klouda and Edita PelantováINTEG 9 (3) 281 (2009)
https://doi.org/10.1515/INTEG.2009.025
Sequences with constant number of return words
L’ubomíra Balková, Edita Pelantová and Wolfgang SteinerMonatshefte für Mathematik 155 (3-4) 251 (2008)
https://doi.org/10.1007/s00605-008-0001-2
Symmetrized β -integers
Julien BernatTheoretical Computer Science 391 (1-2) 164 (2008)
https://doi.org/10.1016/j.tcs.2007.10.041
Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
Ondřej TurekRAIRO - Theoretical Informatics and Applications 41 (2) 123 (2007)
https://doi.org/10.1051/ita:2007009
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
Lubomíra Balková, Edita Pelantová and Ondřej TurekRAIRO - Theoretical Informatics and Applications 41 (3) 307 (2007)
https://doi.org/10.1051/ita:2007025
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)
https://doi.org/10.1016/j.tcs.2007.07.001
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)
https://doi.org/10.1016/j.tcs.2007.03.019
Palindromic complexity of infinite words associated with simple Parry numbers
Petr Ambrož, Zuzana Masáková, Edita Pelantová and Christiane FrougnyAnnales de l'Institut Fourier 56 (7) 2131 (2006)
https://doi.org/10.5802/aif.2236
Developments in Language Theory
Avi Elkharrat and Christiane FrougnyLecture Notes in Computer Science, Developments in Language Theory 3572 209 (2005)
https://doi.org/10.1007/11505877_19
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)
https://doi.org/10.1051/ita:2004014