### 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.

Original language | English |
---|---|

Pages (from-to) | 1-29 |

Number of pages | 29 |

Journal | Mathematical Structures in Computer Science |

DOIs | |

Publication status | Published - Jun 2017 |

## Fingerprint Dive into the research topics of 'Newton series, coinductively: a comparative study of composition'. Together they form a unique fingerprint.

## Cite this

*Mathematical Structures in Computer Science*, 1-29. https://doi.org/10.1017/S0960129517000159