Corrigendum: Complexity of infinite words associated with beta-expansions

Christiane Frougny; Zuzana Masáková; Edita Pelantová

RAIRO - Theoretical Informatics and Applications (2010)

  • Volume: 38, Issue: 3, page 269-271
  • ISSN: 0988-3754

Abstract

top
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.


How to cite

top

Frougny, Christiane, Masáková, Zuzana, and Pelantová, Edita. "Corrigendum: Complexity of infinite words associated with beta-expansions." RAIRO - Theoretical Informatics and Applications 38.3 (2010): 269-271. <http://eudml.org/doc/92743>.

@article{Frougny2010,
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.
},
author = {Frougny, Christiane, Masáková, Zuzana, Pelantová, Edita},
journal = {RAIRO - Theoretical Informatics and Applications},
language = {eng},
month = {3},
number = {3},
pages = {269-271},
publisher = {EDP Sciences},
title = {Corrigendum: Complexity of infinite words associated with beta-expansions},
url = {http://eudml.org/doc/92743},
volume = {38},
year = {2010},
}

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
DA - 2010/3//
PB - EDP Sciences
VL - 38
IS - 3
SP - 269
EP - 271
AB - 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.

LA - eng
UR - http://eudml.org/doc/92743
ER -

Citations in EuDML Documents

top
  1. Lubomíra Balková, Edita Pelantová, Ondřej Turek, Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
  2. L'ubomíra Balková, Zuzana Masáková, Palindromic complexity of infinite words associated with non-simple Parry numbers
  3. L'ubomíra Balková, Zuzana Masáková, Palindromic complexity of infinite words associated with non-simple Parry numbers
  4. Wolfgang Steiner, On the structure of (−)-integers
  5. Wolfgang Steiner, On the structure of (−β)-integers
  6. Petr Ambrož, Zuzana Masáková, Edita Pelantová, Christiane Frougny, Palindromic complexity of infinite words associated with simple Parry numbers

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.