M. Shaull-almagor, F. Cadilhac, G. A. Mazowiecki, and . Pérez, Weak Cost Register Automata Are Still Powerful, Proceedings of the 22nd International Conference on Developments in Language Theory (DLT 2018, vol.11088, pp.83-95, 2018.

R. Alur and L. , Streaming Tree Transducers, Journal of the ACM, vol.64, issue.5, pp.1-55, 2017.

R. Alur, D. Loris, J. V. Antoni, M. Deshmukh, Y. Raghothaman et al., Regular Functions and Cost Register Automata, Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013), pp.13-22, 2013.

R. Alur, E. Filiot, and A. Trivedi, Regular Transformations of Infinite Strings, Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012), pp.65-74, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01196262

R. Alur and M. Raghothaman, Decision Problems for Additive Regular Functions, Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part II (ICALP 2013, vol.7966, pp.37-48, 2013.

M. Anselmo, Two-Way Automata with Multiplicity, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, vol.443, pp.88-102, 1990.

K. Chatterjee, L. Doyen, and T. A. Henzinger, Alternating Weighted Automata, Proceedings of the 17th International Conference on Fundamentals of computation theory (FCT'09), vol.5699, pp.3-13, 2009.

K. Chatterjee, L. Doyen, and T. A. Henzinger, Quantitative languages, ACM Transactions on Computational Logic, vol.11, issue.4, 2010.

L. Daviaud, P. Reynier, and J. Talbot, A Generalised Twinning Property for Minimisation of Cost Register Automata, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS '16), pp.857-866, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01201704

M. Droste, W. Kuich, and H. Vogler, Handbook of Weighted Automata, 2009.

K. Hashiguchi, K. Ishiguro, and S. Jimbo, Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata, International Journal of Algebra and Computation, vol.12, issue.3, p.445, 2002.

P. Kostolányi and F. Misún, Alternating weighted automata over commutative semirings, Theoretical Computer Science, vol.740, pp.1-27, 2018.

F. Mazowiecki and C. Riveros, Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), volume 41 of LIPIcs, pp.144-159, 2015.

F. Mazowiecki and C. Riveros, Copyless cost-register automata: Structure, expressiveness, and closure properties, Journal of Computer and System Sciences, vol.100, pp.1-29, 2019.

M. Mohri, C. N. Fernando, M. Pereira, and . Riley, The Design Principles of a Weighted Finite-State Transducer Library, Theoretical Computer Science, vol.231, issue.1, pp.14-20, 2000.

A. Paz, Some Aspects of Probabilistic Automata. Information and Computation, vol.9, issue.1, pp.26-60, 1966.

O. Michael, Rabin. Probabilistic Automata. Information and Control, vol.6, issue.3, pp.230-245, 1963.

M. P. Schützenberger, On the Definition of a Family of, Automata. Information and Control, vol.4, issue.2-3, pp.245-270, 1961.