Free iterative and iteration K-semialgebras

We consider algebras of rational power series over an alphabet $\Sigma$ with coefficients in a commutative semiring $K$ and characterize them as the free algebras in various classes of algebraic structures.

💡 Research Summary

The paper investigates algebras of rational power series over a finite alphabet Σ with coefficients taken from a commutative semiring K, and shows that these algebras serve as free objects in several natural categories of algebraic structures. After recalling the classical correspondence between regular languages, finite automata, and rational series (when K is the Boolean semiring), the authors generalize the setting to arbitrary commutative semirings, thereby encompassing weighted automata, counting languages, and tropical optimisation problems.

A K‑semialgebra is defined as a set S equipped with an addition, a multiplication, distinguished constants 0 and 1, and a scalar multiplication ⊙ : K × S → S satisfying the usual axioms of a K‑module together with distributivity of ⊙ over the semialgebra operations. The central new notion is that of an iteration K‑semialgebra: a K‑semialgebra endowed with a unary “star” operation a ↦ a* that yields the least solution of the fixed‑point equation a·x = x. This star operation must be K‑linear, i.e., (k ⊙ a)* = k ⊙ a* for all k ∈ K, ensuring compatibility with the underlying semiring structure.

The authors construct, for any set X of generators, the algebra of rational power series K⟨⟨X⟩⟩. They prove that K⟨⟨X⟩⟩, equipped with the usual series addition, Cauchy product, scalar multiplication, and the star defined by the infinite sum Σ_{n≥0} aⁿ, satisfies the axioms of an iteration K‑semialgebra. Moreover, they establish a universal property: for every iteration K‑semialgebra A and every function f : X → A, there exists a unique K‑linear iteration homomorphism (\hat f : K⟨⟨X⟩⟩ → A) extending f. This shows that K⟨⟨X⟩⟩ is the free iteration K‑semialgebra on X.

The paper proceeds to formulate three main theorems. The first theorem states that, for any commutative semiring K, the rational series algebra K⟨⟨Σ⟩⟩ is the free iterative K‑semialgebra generated by Σ. The second theorem provides a Kleene‑Büchi‑type correspondence: the behaviours of K‑weighted finite automata are exactly the elements of K⟨⟨Σ⟩⟩, and every rational series can be expressed both as a weighted regular expression and as the behaviour of some weighted automaton. The third theorem specializes to idempotent semirings (e.g., the tropical semiring) and shows that the free iteration K‑semialgebra coincides with the algebra of optimal‑path weights, thereby linking the abstract theory to concrete optimisation problems.

A substantial part of the work is devoted to categorical foundations. The authors define the category of K‑semialgebras with K‑linear homomorphisms and the subcategory of iteration K‑semialgebras with star‑preserving homomorphisms. They construct a left adjoint to the forgetful functor from iteration K‑semialgebras to K‑semialgebras, and identify this left adjoint with the rational series construction. This adjunction yields the free‑object result in a clean, abstract manner.

The paper concludes with several illustrative examples. When K = ℕ, rational series count the number of accepting paths of a nondeterministic automaton, giving a quantitative version of regular languages. When K = Boolean, the construction collapses to the classical iteration semiring of regular expressions, and the star operation coincides with the Kleene star. When K is the tropical semiring (ℝ ∪ {∞}, min, +), rational series encode the minimal weight of paths labelled by a word, and the star computes the minimal weight of arbitrarily many repetitions of a loop. These examples demonstrate that the theory unifies disparate domains—formal language theory, weighted automata, and optimisation—under a single algebraic umbrella.

Finally, the authors outline future directions: extending the framework to non‑commutative or non‑idempotent semirings, investigating continuity conditions for the star operation, and exploring connections with coalgebraic models, probabilistic systems, and quantum automata. The paper thus provides both a solid theoretical foundation for iteration K‑semialgebras and a versatile toolbox for applications across computer science and mathematics.