Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents

TL;DR

This paper introduces reversible weighted automata over finite rings, characterizes their supported languages via commuting idempotents in syntactic monoids, and proves the decidability of realizability over such rings.

Contribution

It provides a new automata-theoretic characterization of rational languages associated with reversible weighted automata over finite rings and establishes decidability results.

Findings

Supports of series are exactly rational languages with commuting idempotents.

Reversible weighted automata over finite fields can be directly identified with certain languages.

Decidability of realizability of rational series by reversible automata over finite rings.

Abstract

Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such automata are precisely the rational languages such that the idempotents in their syntactic monoids commute. In particular, this is true for reversible weighted automata over the finite field $\mathbb{F}_2$, where the realised series can be directly identified with such languages. A new automata-theoretic characterisation is thus obtained for the variety of rational languages corresponding to the pseudovariety of finite monoids $\mathbf{ECom}$, which also forms the Boolean closure of the reversible languages in the sense of J.-\'E. Pin. The problem of determining whether a rational series over a locally finite commutative ring can be realised by a reversible weighted automaton is decidable as a consequence.