On the complexity of infinite sequences. (Sur la complexité des suites infinies.)
Bulletin of the Belgian Mathematical Society - Simon Stevin (1994)
- Volume: 1, Issue: 2, page 133-143
- ISSN: 1370-1444
Access Full Article
top
How to cite
topAllouche, Jean-Paul. "On the complexity of infinite sequences. (Sur la complexité des suites infinies.)." Bulletin of the Belgian Mathematical Society - Simon Stevin 1.2 (1994): 133-143. <http://eudml.org/doc/226837>.
@article{Allouche1994,
author = {Allouche, Jean-Paul},
journal = {Bulletin of the Belgian Mathematical Society - Simon Stevin},
keywords = {factors of infinite words; subwords of infinite words; substitutive sequences; automatic sequences; CD0L sequences; complexity},
language = {eng},
number = {2},
pages = {133-143},
publisher = {Société Mathématique de Belgique - Belgisch Wiskundig Genootschap},
title = {On the complexity of infinite sequences. (Sur la complexité des suites infinies.)},
url = {http://eudml.org/doc/226837},
volume = {1},
year = {1994},
}
TY - JOUR
AU - Allouche, Jean-Paul
TI - On the complexity of infinite sequences. (Sur la complexité des suites infinies.)
JO - Bulletin of the Belgian Mathematical Society - Simon Stevin
PY - 1994
PB - Société Mathématique de Belgique - Belgisch Wiskundig Genootschap
VL - 1
IS - 2
SP - 133
EP - 143
LA - eng
KW - factors of infinite words; subwords of infinite words; substitutive sequences; automatic sequences; CD0L sequences; complexity
UR - http://eudml.org/doc/226837
ER -
Citations in EuDML Documents
top- Valérie Berthé, Laurent Vuillon, Suites doubles de basse complexité
- Valérie Berthé, Complexité et automates cellulaires linéaires
- Gilles Didier, Combinatoire des codages de rotations
- Jean-Paul Allouche, Mireille Bousquet-Mélou, On the conjectures of Rauzy and Shallit for infinite words
- Valérie Berthé, Complexité et automates cellulaires linéaires
- Christiane Frougny, Zuzana Masáková, Edita Pelantová, Complexity of infinite words associated with beta-expansions
- Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu, A note on constructing infinite binary words with polynomial subword complexity
- Idrissa Kaboré, Théodore Tapsoba, Combinatoire de mots récurrents de complexité
- Christiane Frougny, Zuzana Masáková, Edita Pelantová, Complexity of infinite words associated with beta-expansions
- Louis-Sébastien Guimond, Zuzana Masáková, Edita Pelantová, Combinatorial properties of infinite words associated with cut-and-project sequences
NotesEmbed ?
topYou 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.