Corrigendum : “Complexity of infinite words associated with beta-expansions”
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 3, pp. 269-271.

We add a sufficient condition for validity of Propo- sition 4.10 in the paper Frougny et al. (2004). This condition is not a necessary one, it is nevertheless convenient, since anyway most of the statements in the paper Frougny et al. (2004) use it.

DOI : 10.1051/ita:2004014
Classification : 11A63, 11A67, 37B10, 68R15
Frougny, Christiane 1 ; Masáková, Zuzana  ; Pelantová, Edita 

1 Université Paris 7 LIAFA, UMR 7089 CNRS 2 place Jussieu 75251 Paris Cedex 05 (France) and Université Paris 8
@article{ITA_2004__38_3_269_0,
     author = {Frougny, Christiane and Mas\'akov\'a, Zuzana and Pelantov\'a, Edita},
     title = {Corrigendum : {{\textquotedblleft}Complexity} of infinite words associated with beta-expansions{\textquotedblright}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {269--271},
     publisher = {EDP-Sciences},
     volume = {38},
     number = {3},
     year = {2004},
     doi = {10.1051/ita:2004014},
     mrnumber = {2076404},
     zbl = {1104.11013},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ita:2004014/}
}
TY  - JOUR
AU  - Frougny, Christiane
AU  - Masáková, Zuzana
AU  - Pelantová, Edita
TI  - Corrigendum : “Complexity of infinite words associated with beta-expansions”
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2004
SP  - 269
EP  - 271
VL  - 38
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita:2004014/
DO  - 10.1051/ita:2004014
LA  - en
ID  - ITA_2004__38_3_269_0
ER  - 
%0 Journal Article
%A Frougny, Christiane
%A Masáková, Zuzana
%A Pelantová, Edita
%T Corrigendum : “Complexity of infinite words associated with beta-expansions”
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2004
%P 269-271
%V 38
%N 3
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ita:2004014/
%R 10.1051/ita:2004014
%G en
%F ITA_2004__38_3_269_0
Frougny, Christiane; Masáková, Zuzana; Pelantová, Edita. Corrigendum : “Complexity of infinite words associated with beta-expansions”. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 3, pp. 269-271. doi : 10.1051/ita:2004014. http://www.numdam.org/articles/10.1051/ita:2004014/

[1] J. Bernat and V. Berthé, Oral communication.

[2] Ch. Frougny, Z. Masáková and E. Pelantová, Complexity of infinite words associated with beta-expansions. RAIRO-Inf. Theor. Appl. 38 (2004) 163-185. | Numdam | Zbl

  • Langeveld, Niels; Rossi, Lucía; Thuswaldner, Jörg M. Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms, Journal of Number Theory, Volume 250 (2023), pp. 49-83 | DOI:10.1016/j.jnt.2023.03.008 | Zbl:7691009
  • He, Xinwei; Hildebrand, A. J.; Li, Yuchen; Zhang, Yunyi Complexity of leading digit sequences, Discrete Mathematics and Theoretical Computer Science. DMTCS, Volume 22 (2020) no. 1, p. 30 (Id/No 14) | DOI:10.23638/dmtcs-22-1-14 | Zbl:1456.11135
  • Masáková, Z.; Pelantová, E. Optimal number representations in negative base, Acta Mathematica Hungarica, Volume 140 (2013) no. 4, pp. 329-340 | DOI:10.1007/s10474-013-0336-6 | Zbl:1299.11053
  • Steiner, Wolfgang On the structure of \((-\beta )\)-integers, RAIRO. Theoretical Informatics and Applications, Volume 46 (2012) no. 1, pp. 181-200 | DOI:10.1051/ita/2011115 | Zbl:1319.11006
  • Dubickas, Artūras On \(\beta \)-expansions of unity for rational and transcendental numbers \(\beta \), Mathematica Slovaca, Volume 61 (2011) no. 5, pp. 705-716 | DOI:10.2478/s12175-011-0040-3 | Zbl:1274.11023
  • Drungilas, Paulius; Dubickas, Artūras Roots of polynomials of bounded height, Rocky Mountain Journal of Mathematics, Volume 39 (2009) no. 2, pp. 527-543 | DOI:10.1216/rmj-2009-39-2-527 | Zbl:1186.12001
  • Balková, L'ubomíra; Pelantová, Edita; Steiner, Wolfgang Sequences with constant number of return words, Monatshefte für Mathematik, Volume 155 (2008) no. 3-4, pp. 251-263 | DOI:10.1007/s00605-008-0001-2 | Zbl:1185.68503
  • Bernat, Julien Symmetrized \(\beta \)-integers, Theoretical Computer Science, Volume 391 (2008) no. 1-2, pp. 164-177 | DOI:10.1016/j.tcs.2007.10.041 | Zbl:1135.11008
  • Turek, Ondřej Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers, RAIRO. Theoretical Informatics and Applications, Volume 41 (2007) no. 2, pp. 123-135 | DOI:10.1051/ita:2007009 | Zbl:1146.68410
  • Balková, Lubomíra; Pelantová, Edita; Turek, Ondřej Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers, RAIRO. Theoretical Informatics and Applications, Volume 41 (2007) no. 3, pp. 307-328 | DOI:10.1051/ita:2007025 | Zbl:1144.11009
  • Baláži, Peter; Masáková, Zuzana; Pelantová, Edita Factor versus palindromic complexity of uniformly recurrent infinite words, Theoretical Computer Science, Volume 380 (2007) no. 3, pp. 266-275 | DOI:10.1016/j.tcs.2007.03.019 | Zbl:1119.68137
  • Bernat, Julien; Masáková, Zuzana; Pelantová, Edita On a class of infinite words with affine factor complexity, Theoretical Computer Science, Volume 389 (2007) no. 1-2, pp. 12-25 | DOI:10.1016/j.tcs.2007.07.001 | Zbl:1143.68062
  • Ambrož, Petr; Masáková, Zuzana; Pelantová, Edita; Frougny, Christiane Palindromic complexity of infinite words associated with simple Parry numbers, Annales de l'Institut Fourier, Volume 56 (2006) no. 7, pp. 2131-2160 | DOI:10.5802/aif.2236 | Zbl:1121.68089
  • Masáková, Zuzana Arithmetical and combinatorial properties of \(\beta\)-integers, Annales des Sciences Mathématiques du Québec, Volume 28 (2004) no. 1-2, pp. 153-164 | Zbl:1114.11009

Cité par 14 documents. Sources : zbMATH