Skip to main content

Newton series, coinductively: a comparative study of composition


We present a comparative study of four product operators on weighted languages: (i) the convolution, (ii) the shuffle, (iii) the infiltration and (iv) the Hadamard product. Exploiting the fact that the set of weighted languages is a final coalgebra, we use coinduction to prove that an operator of the classical difference calculus, the Newton transform, generalises from infinite sequences to weighted languages. We show that the Newton transform is an isomorphism of rings that transforms the Hadamard product of two weighted languages into their infiltration product, and we develop various representations for the Newton transform of a language, together with concrete calculation rules for computing them.

Hide All
Barbosa, L. (2001). Components as Coalgebras. PhD thesis, Universidade do Minho, Braga, Portugal.
Bartels, F. (2004). On Generalised Coinduction and Probabilistic Specification Formats. PhD thesis, Vrije Universiteit, Amsterdam.
Basold, H., Hansen, H.H., Pin, J.-E. and Rutten, J.J.M.M. (2015). Newton series, coinductively. In: Leucker, M., Rueda, C. and Valencia, F.D. (eds.) Theoretical Aspects of Computing – ICTAC 2015, Lecture Notes in Computer Science, vol. 9399, Springer, 91109.
Bergeron, F., Labelle, G. and Leroux, P. (1998). Combinatorial Species and Tree-like Structures, Encyclopedia of Mathematics and its Applications, vol. 67. Cambridge University Press.
Bergstra, J. and Klop, J.W. (1984). Process algebra for synchronous communication. Information and Control 60 (1) 109137.
Berstel, J. and Reutenauer, C. (1988). Rational Series and their Languages, EATCS Monographs on Theoretical Computer Science, vol. 12, Springer-Verlag.
Bonchi, F. and Pous, D. (2015). Hacking nondeterminism with induction and coinduction. Communications of the ACM 58 (2) 8795.
Burns, S.A. and Palmore, J.I. (1989). The newton transform: An operational method for constructing integral of dynamical systems. Physica D: Nonlinear Phenomena 37 (13) 8390. ISSN .
Chen, K., Fox, R. and Lyndon, R. (1958). Free differential calculus, IV – The quotient groups of the lower series. Annals of Mathemathics. Second Series 68 (1) 8195.
Comtet, L. (1974). Advanced Combinatorics, D. Reidel Publishing Company.
Conway, J.H. (1971). Regular Algebra and Finite Machines, Chapman and Hall.
Eilenberg, S. (1974). Automata, Languages and Machines (Vol. A). Pure and Applied Mathematics. Academic Press.
Graham, R.L., Knuth, D.E. and Patashnik, O. (1994). Concrete Mathematics, 2nd edition, Addison-Wesley.
Hansen, H.H., Kupke, C. and Rutten, J.J.M.M. (2014). Stream differential equations: Specification formats and solution methods. Report FM-1404, CWI. Available at:
Lothaire, M. (1997). Combinatorics on Words, Cambridge Mathematical Library, Cambridge University Press.
Niqui, M. and Rutten, J.J.M.M. (2011). A proof of Moessner's theorem by coinduction. Higher-Order and Symbolic Computation 24 (3) 191206.
Pavlović, D. and Escardó, M. (1998). Calculus in coinductive form. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 408–417.
Pin, J.-E. (2015). Newton's forward difference equation for functions from words to words. In: Proceedings of the Evolving Computability – 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, 71–82. Available at:
Pin, J.E. and Silva, P.V. (2014). A noncommutative extension of Mahler's theorem on interpolation series. European Journal of Combinatorics 36 564578.
Rot, J. (2015). Enhanced Coinduction. Phd, University Leiden, Leiden.
Rot, J., Bonsangue, M.M. and Rutten, J.J.M.M. (2013). Coalgebraic bisimulation-up-to. In: SOFSEM, Lecture Notes in Computer Science, vol. 7741, Springer, 369381.
Rutten, J.J.M.M. (2000). Universal coalgebra: A theory of systems. Theoretical Computer Science 249 (1) 380.
Rutten, J.J.M.M. (2003a). Coinductive counting with weighted automata. Journal of Automata, Languages and Combinatorics 8 (2) 319352.
Rutten, J.J.M.M. (2003b). Behavioural differential equations: A coinductive calculus of streams, automata, and power series. Theoretical Computer Science 308 (1) 153.
Rutten, J.J.M.M. (2005). A coinductive calculus of streams. Mathematical Structures in Computer Science 15 93147.
Scheid, F. (1968). Theory and Problems of Numerical Analysis (Schaum's outline series), McGraw-Hill.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *