| Issue |
RAIRO-Theor. Inf. Appl.
Volume 46, Number 1, January-March 2012
Special issue dedicated to the 13th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 67 - 76 | |
| DOI | https://doi.org/10.1051/ita/2011126 | |
| Published online | 23 November 2011 | |
Three complexity functions
1
Institut de Mathématiques de Luminy, CNRS UMR 6206,
Case 907, 163 av. de
Luminy, 13288
Marseille Cedex 9,
France
ferenczi@iml.univ-mrs.fr
2
Fédération de Recherche des Unités de Mathématiques de Marseille, CNRS FR,
2291,
France
3
Laboratoire d’Analyse, Topologie et Probabilités, CNRS UMR 6632,
Case A, Faculté de Saint Jérôme, Avenue Escadrille Normandie-Niemen, 13397
Marseille Cedex 20,
France
hubert@cmi.univ-mrs.fr
Received: 2 November 2010
Accepted: 10 October 2011
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.
Mathematics Subject Classification: 37B10 / 68R15
Key words: Infinite words / symbolic dynamical systems / complexity
© EDP Sciences 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.