Skip to main content
×
Home
    • Aa
    • Aa

Newton series, coinductively: a comparative study of composition

  • HENNING BASOLD (a1), HELLE HVID HANSEN (a2), JEAN-ÉRIC PIN (a3) and JAN RUTTEN (a4)
Abstract

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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

H. Basold , H.H. Hansen , J.-E. Pin and J.J.M.M. Rutten (2015). Newton series, coinductively. In: M. Leucker , C. Rueda and F.D. Valencia (eds.) Theoretical Aspects of Computing – ICTAC 2015, Lecture Notes in Computer Science, vol. 9399, Springer, 91109.

J. Bergstra and J.W. Klop (1984). Process algebra for synchronous communication. Information and Control 60 (1) 109137.

F. Bonchi and D. Pous (2015). Hacking nondeterminism with induction and coinduction. Communications of the ACM 58 (2) 8795.

S.A. Burns and J.I. Palmore (1989). The newton transform: An operational method for constructing integral of dynamical systems. Physica D: Nonlinear Phenomena 37 (13) 8390. ISSN 0167-2789.

K. Chen , R. Fox and R. Lyndon (1958). Free differential calculus, IV – The quotient groups of the lower series. Annals of Mathemathics. Second Series 68 (1) 8195.

L. Comtet (1974). Advanced Combinatorics, D. Reidel Publishing Company.

M. Lothaire (1997). Combinatorics on Words, Cambridge Mathematical Library, Cambridge University Press.

J.E. Pin and P.V. Silva (2014). A noncommutative extension of Mahler's theorem on interpolation series. European Journal of Combinatorics 36 564578.

J.J.M.M. Rutten (2000). Universal coalgebra: A theory of systems. Theoretical Computer Science 249 (1) 380.

J.J.M.M. Rutten (2005). A coinductive calculus of streams. Mathematical Structures in Computer Science 15 93147.

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? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 16 *
Loading metrics...

Abstract views

Total abstract views: 72 *
Loading metrics...

* Views captured on Cambridge Core between 7th June 2017 - 21st September 2017. This data will be updated every 24 hours.