Commutative algebras of series

TL;DR

This paper characterizes and analyzes a broad family of product operations on formal power series in noncommuting variables, establishing their algebraic properties and the decidability of automata equivalence problems.

Contribution

It provides a complete, decidable characterization of all bilinear, associative, and commutative product rules, extending results to various known products and automata.

Findings

Infinite family of such products includes Hadamard, shuffle, infiltration

Decidability of automata equivalence for these products

Formalized results in Agda proof assistant

Abstract

We consider a large family of product operations of formal power series in noncommuting indeterminates, the classes of automata they define, and the respective equivalence problems. A $P$-product of series is defined coinductively by a polynomial product rule $P$, which gives a recursive recipe to build the product of two series as a function of the series themselves and their derivatives. The first main result of the paper is a complete and decidable characterisation of all product rules $P$ giving rise to $P$-products which are bilinear, associative, and commutative. The characterisation shows that there are infinitely many such products, and in particular it applies to the notable Hadamard, shuffle, and infiltration products from the literature. Every $P$-product gives rise to the class of $P$-automata, an infinite-state model where states are terms. The second main result of the paper is that the equivalence problem for $P$-automata is decidable for $P$-products satisfying our characterisation. This explains, subsumes, and extends previous results on Hadamard, shuffle, and infiltration automata. We have formalised most results in the proof assistant Agda.