A. V. Aho and M. J. Corasick, EEcient string matching: an aid to bibliographic search, Comm. ACM, vol.18, pp.6-333, 1975.
DOI : 10.1145/360825.360855

R. Ash, Information Theory. Tracts in mathematics, 1985.

J. Berstel, Fibonacci Words | a Survey. in (The Book of, 1986.
URL : https://hal.archives-ouvertes.fr/hal-00620647

T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression, 1990.

M. Crochemore and C. Hancart, Automata for matching patterns. in (Handbook of Formal Languages, Linear Modeling: Background and Application) Chapter 9, pp.399-462, 1997.
DOI : 10.1007/978-3-662-07675-0_9
URL : https://hal.archives-ouvertes.fr/hal-00620792

M. Crochemore, F. Mignosi, and A. Restivo, Minimal forbidden words and factor automata
DOI : 10.1007/BFb0055817
URL : https://hal.archives-ouvertes.fr/hal-00619990

M. Crochemore, F. Mignosi, and A. Restivo, Automata and forbidden words, Information Processing Letters, vol.67, issue.3, 1998.
DOI : 10.1016/S0020-0190(98)00104-5
URL : https://hal.archives-ouvertes.fr/hal-00619578

R. S. Ellis, Entropy, Large Deviations, and Statistical Mechanics, 1985.
DOI : 10.1007/978-1-4613-8533-2
URL : http://link.springer.com/content/pdf/bfm%3A978-3-540-29060-5%2F1.pdf

J. Gailly, Frequently Asked Questions in data compression, Internet Available at http://www.landfield.com/faqs/compression-faq/part1/preamble.html or ftp

J. G. Kemeny and J. L. Snell, Finite Markov Chains, 1960.

R. Krichevsky, Universal Compression and Retrieval, 1994.
DOI : 10.1007/978-94-017-3628-2

M. Morse and G. Hedlund, Symbolic Dynamics II. Sturmian Trajectories, American Journal of Mathematics, vol.62, issue.1/4, pp.1-40, 1940.
DOI : 10.2307/2371431

M. Nelson and J. Gailly, The Data Compression Book, 1996.

C. Shannon, Prediction and Entropy of Printed English, Bell System Technical Journal, vol.30, issue.1, pp.50-64, 1951.
DOI : 10.1002/j.1538-7305.1951.tb01366.x

J. A. Storer, Data Compression: Methods and Theory, 1988.