C. Allauzen and M. Mohri, Efficient algorithms for testing the twins property, Journal of Automata, Languages and Combinatorics, vol.8, issue.2, pp.117-144, 2003.

M. Béal, O. Carton, C. Prieur, and J. Sakarovitch, Squaring transducers: an efficient procedure for deciding functionality and sequentiality, Theoretical Computer Science, vol.292, issue.1, pp.45-63, 2003.
DOI : 10.1016/S0304-3975(01)00214-6

J. Berstel, Transductions and context-free languages, 1979.
DOI : 10.1007/978-3-663-09367-1

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

J. Berstel and C. Reutenauer, Rational Series and their Languages, 1988.
DOI : 10.1007/978-3-642-73235-5

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

M. Brilman and J. M. Vincent, Dynamics of synchronized parallel systems, Communications in Statistics. Stochastic Models, vol.3, issue.3, pp.605-619, 1997.
DOI : 10.1080/15326349708807441

A. L. Buchsbaum, R. Giancarlo, and J. R. Westbrook, On the Determinization of Weighted Finite Automata, SIAM Journal on Computing, vol.30, issue.5, pp.1502-1531, 2000.
DOI : 10.1137/S0097539798346676

C. Choffrut, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles, Theoretical Computer Science, vol.5, issue.3, pp.325-337, 1977.
DOI : 10.1016/0304-3975(77)90049-4

C. Choffrut, ContributionàContribution`Contributionà l'´ etude de quelques familles remarquables de fonctions rationnelles, Thèse d'´ etat, 1978.

S. Eilenberg, Automata, languages and machines, 1974.

S. Gaubert, Performance evaluation of (max,+) automata, IEEE Transactions on Automatic Control, vol.40, issue.12, pp.2014-2025, 1995.
DOI : 10.1109/9.478227

S. Gaubert and J. Mairesse, Task resource models and (max, +) automata
DOI : 10.1017/CBO9780511662508.009

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

S. Gaubert and J. Mairesse, Modeling and analysis of timed Petri nets using heaps of pieces, IEEE Transactions on Automatic Control, vol.44, issue.4, pp.683-698, 1999.
DOI : 10.1109/9.754807

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

K. Hashigushi, Algorithms for determining relative star height and star height, Information and Computation, vol.78, issue.2, pp.124-169, 1988.
DOI : 10.1016/0890-5401(88)90033-8

K. Hashigushi, K. Ishiguro, and S. Jimbo, DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA, International Journal of Algebra and Computation, vol.12, issue.03, pp.445-461, 2002.
DOI : 10.1142/S0218196702000845

D. Krob, THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE, International Journal of Algebra and Computation, vol.04, issue.03, pp.405-425, 1994.
DOI : 10.1142/S0218196794000063

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

D. Krob and A. Bonnier-rigny, A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring, Theor. Comput. Sci, vol.134, pp.27-50, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00017324

M. Mohri, Finite-state transducers in language and speech processing, Comput. Linguist, vol.23, issue.2, pp.269-311, 1997.

P. Moller, Théorie algébrique des systèmessystèmes`systèmesàsystèmesàévénements discrets, 1988.

J. Sakarovitch, A construction on finite automata that has remained hidden, Theoretical Computer Science, vol.204, issue.1-2, pp.205-231, 1998.
DOI : 10.1016/S0304-3975(98)00040-1

M. Schützenberger, On the definition of a family of automata, Information and Control, vol.4, issue.2-3, pp.245-270, 1961.
DOI : 10.1016/S0019-9958(61)80020-X

M. Schützenberger, Sur les relations rationnelles entre monoides libres, Theoretical Computer Science, vol.3, issue.2, pp.243-259, 1976.
DOI : 10.1016/0304-3975(76)90026-8

I. Simon, Recognizable sets with multiplicities in the tropical semiring, Proc. 13th Symp., number 324 in LNCS, pp.107-120, 1988.
DOI : 10.1007/BFb0017135

G. X. Viennot, Heaps of pieces, I: Basic definitions and combinatorial lemmas, Combinatoiré Enumérative, number 1234 in Lect. Notes in Math, pp.321-350, 1986.

A. Weber, Finite-valued distance automata, Theoretical Computer Science, vol.134, issue.1, pp.225-251, 1994.
DOI : 10.1016/0304-3975(94)90287-9

URL : http://doi.org/10.1016/0304-3975(94)90287-9

A. Weber and R. Klemm, Economy of Description for Single-Valued Transducers, Information and Computation, vol.118, issue.2, pp.327-340, 1995.
DOI : 10.1006/inco.1995.1071

A. Weber and H. Seidl, On the degree of ambiguity of finite automata, Theoretical Computer Science, vol.88, issue.2, pp.325-349, 1991.
DOI : 10.1016/0304-3975(91)90381-B