An algorithm for the word entropy - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2018

An algorithm for the word entropy

Résumé

For any infinite word w on a finite alphabet A, the complexity function p w of w is the sequence counting, for each non-negative n, the number p w (n) of words of length n on the alphabet A that are factors of the infinite word w and the entropy of w is the quantity E(w) = lim n→∞ 1 n log p w (n). For any given function f with exponential growth, Mauduit and Moreira introduced in [MM17] the notion of word entropy E W (f) = sup{E(w), w ∈ A N , p w ≤ f } and showed its links with fractal dimensions of sets of infinite sequences with complexity function bounded by f. The goal of this work is to give an algorithm to estimate with arbitrary precision E W (f) from finitely many values of f .
Fichier principal
Vignette du fichier
FerencziMauduitMoreira.pdf (293.91 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02120144 , version 1 (05-05-2019)

Identifiants

Citer

Sébastien Ferenczi, Christian Mauduit, Carlos Gustavo Moreira. An algorithm for the word entropy. Theoretical Computer Science, 2018, 743, pp.1-11. ⟨hal-02120144⟩
59 Consultations
102 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More