?. Transducteur-calculant and .. Qui-extrait-les-facteurs, Chaque transition est validée par une lettre d'entrée : les transition avec etiquette a | a copie l'entrée vers la sortie, les transitions avecétiquette avecétiquette a | ? n'ont pas de sorties, p.50

U. Transducteur-effaçant-les-lettres-d-'entrées and .. , Chaque transition estétiquetéeestétiquetée par une lettre d'entrée : Les transitions d'´ etiquette a | a copient l'entrée vers la sortie, les transitions d'´ etiquette a | ? efface l'entrée, p.54

J. Berstel and C. Reutenauer, Rational series and their languages, EATCS Monographs on Theoretical Computer Science, vol.12, 1988.
DOI : 10.1007/978-3-642-73235-5

URL : https://hal.archives-ouvertes.fr/hal-00619791

J. G. Brookshear, Formal languages, automata, and complexity theory of computation, 1989.

C. Burges, A tutorial on support vector machines for pattern recognition, Data Mining and Knowledge Discovery, vol.2, issue.2, pp.121-167, 1998.
DOI : 10.1023/A:1009715923555

J. Carroll and D. D. Long, Theory of finite automata with an introduction to formal languages, 1989.

T. Claveirole, S. Lombardy, S. O-'connor, L. Pouchet, and J. Sakarovitch, Inside Vaucanson, CIAA 2005, 2005.
DOI : 10.1007/11605157_10

URL : https://hal.archives-ouvertes.fr/hal-00619840

M. Collins, D. , and N. , Convolution kernels for natural language, NIPS 2001, pp.625-632, 2002.

G. V. Cormack and R. N. Horspool, Data Compression Using Dynamic Markov Modelling, The Computer Journal, vol.30, issue.6, pp.541-550, 1987.
DOI : 10.1093/comjnl/30.6.541

C. Cortes, P. Haffner, and M. Mohri, Rational kernels, NIPS 2002, pp.601-608, 2002.

C. Cortes, P. Haffner, and M. Mohri, Rational kernels : Theory and algorithms, Journal of Machine Learning Research, vol.5, pp.1035-1062, 2004.

C. Cortes, M. Mohri, and A. Rastogi, DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA, International Journal of Foundations of Computer Science, vol.18, issue.04, pp.761-779, 2007.
DOI : 10.1142/S0129054107004966

C. Cortes, M. Mohri, A. Rastogi, R. , and M. , Efficient Computation of the Relative Entropy of Probabilistic Automata, Lecture Notes in Computer Science, vol.3887, pp.323-336, 2006.
DOI : 10.1007/11682462_32

A. H. David, A method for the construction of minimum redundancy codes, Institute of Radio Engineers, vol.40, issue.9, pp.1098-1101, 1952.

M. Droste, W. Kuich, and H. Vogler, Handbook of Weighted Automata, 2009.
DOI : 10.1007/978-3-642-01492-5

S. Eilenberg, Automata, Languages, and Machines, volume A, 1974.

R. Herbrich, Learning Kernel Classifiers : Theory and Algorithms, 2002.

T. Hofmann, B. Schölkopf, and A. J. Smola, Kernel methods in machine learning, The Annals of Statistics, vol.36, issue.3, pp.1171-1220, 2008.
DOI : 10.1214/009053607000000677

C. B. Jones, An efficient coding system for long source sequences, IEEE Transactions on Information Theory, vol.27, issue.3, pp.280-291, 1981.
DOI : 10.1109/TIT.1981.1056356

L. Kontorovich, C. Cortes, and M. Mohri, Kernel methods for learning languages, Theoretical Computer Science, vol.405, issue.3, pp.223-236, 2008.
DOI : 10.1016/j.tcs.2008.06.037

W. Kuich, A. Salomaa, and . Semirings, of Monographs in Theoretical Computer Science, 1986.

J. A. Llewellyn, Data Compression for a Source with Markov Characteristics, The Computer Journal, vol.30, issue.2, pp.149-156, 1987.
DOI : 10.1093/comjnl/30.2.149

H. Lodhi, C. Saunders, J. Shawe-taylor, N. Cristianini, and C. Watkins, Text classification using string kernels, Journal of Machine Learning Research, vol.2, pp.419-444, 2002.

H. Lodhi, J. Shawe-taylor, N. Cristianini, and C. J. Watkins, Text classification using string kernels, NIPS 2000, pp.563-569, 2001.

S. Lombardy and J. Sakarovitch, Derivatives of rational expressions with multiplicity, Theoretical Computer Science, vol.332, issue.1-3, pp.141-177, 2005.
DOI : 10.1016/j.tcs.2004.10.016

URL : https://hal.archives-ouvertes.fr/hal-00017202

S. Lombardy and J. Sakarovitch, THE VALIDITY OF WEIGHTED AUTOMATA, International Journal of Algebra and Computation, vol.23, issue.04, pp.863-913, 2013.
DOI : 10.1142/S0218196713400146

URL : https://hal.archives-ouvertes.fr/hal-00845820

M. Mohri, Weighted automata algorithms In Handbook of Weighted Automata, pp.213-254, 2009.

F. C. Pereira, R. , and M. , Speech recognition by composition of weighted finite automata, p.9603001, 1996.

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218

J. Sakarovitch, Rational and Recognisable Power Series, Handbook of Weighted Automata, pp.105-174, 2009.
DOI : 10.1007/978-3-642-01492-5_4

URL : https://hal.archives-ouvertes.fr/hal-00479545

B. Scholkopf and A. J. Smola, Learning with Kernels : Support Vector Machines, Regularization Optimization and Beyond, 2002.

C. E. Shannon, A mathematical theory of communication. The Bell System Technica, pp.379-423, 1948.

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Languages, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7

J. Zhou, O. C. Au, X. Fan, and P. H. Wong, Secure Lempel- Ziv-Welch (LZW) algorithm with random dictionary insertion and permutation, ICME 2008, pp.245-248, 2008.

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714