Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-26T13:27:19.719Z Has data issue: false hasContentIssue false
  • English
  • Français

Corrigendum: Complexity of infinite words associated withbeta-expansions

Published online by Cambridge University Press:  15 June 2004

Christiane Frougny ,
Zuzana Masáková  and
Edita Pelantová
Christiane Frougny
Affiliation:
LIAFA, CNRS UMR 7089, 2 place Jussieu, 75251 Paris Cedex 05, France; [email protected]. Université Paris 8.
Zuzana Masáková
Affiliation:
Department of Mathematics, FNSPE, Czech Technical University, Trojanova 13, 120 00 Praha 2, Czech Republic; [email protected].; [email protected].
Edita Pelantová
Affiliation:
Department of Mathematics, FNSPE, Czech Technical University, Trojanova 13, 120 00 Praha 2, Czech Republic; [email protected].; [email protected].
Get access

Abstract

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.


Keywords

Type
Correction
Information
RAIRO - Theoretical Informatics and Applications , Volume 38 , Issue 3 , July 2004 , pp. 269 - 271
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

J. Bernat and V. Berthé, Oral communication.
Ch. Frougny, Z. Masáková, E. Pelantová, Complexity of infinite words associated with beta-expansions. RAIRO-Inf. Theor. Appl. 38 (2004) 163–185. CrossRef