{
  "annotation_id": "84f6d8eb-643e-48af-af52-938b33e68520",
  "date_created": "2026-02-17T05:53:19.905000Z",
  "date_modified": "2026-02-17T05:53:19.905000Z",
  "file_hash": "c03f4f694edb7f3469df8cf0601a0463c1974325bef732b9fa49513152ddfddf",
  "private": false,
  "record": {
    "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.-\\\u0027E. 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.",
    "arxiv_id": "2601.09409",
    "authors": [
      "Peter Kostol\u00e1nyi",
      "Andrej Ravinger"
    ],
    "categories": [
      "cs.FL"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents",
    "url": "https://arxiv.org/abs/2601.09409",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6ce68ceb-29f5-4294-89db-f48144f333fd",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}