Voir la notice de l'article provenant de la source Numdam
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
@article{ITA_2012__46_1_67_0,
author = {Ferenczi, S\'ebastien and Hubert, Pascal},
title = {Three complexity functions},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {67--76},
publisher = {EDP-Sciences},
volume = {46},
number = {1},
year = {2012},
doi = {10.1051/ita/2011126},
mrnumber = {2904961},
zbl = {1271.37012},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2011126/}
}
TY - JOUR AU - Ferenczi, Sébastien AU - Hubert, Pascal TI - Three complexity functions JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2012 SP - 67 EP - 76 VL - 46 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2011126/ DO - 10.1051/ita/2011126 LA - en ID - ITA_2012__46_1_67_0 ER -
%0 Journal Article %A Ferenczi, Sébastien %A Hubert, Pascal %T Three complexity functions %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2012 %P 67-76 %V 46 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2011126/ %R 10.1051/ita/2011126 %G en %F ITA_2012__46_1_67_0
Ferenczi, Sébastien; Hubert, Pascal. Three complexity functions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012) no. 1, pp. 67-76. doi: 10.1051/ita/2011126
Cité par Sources :