Tootfinder

This https://arxiv.org/abs/2406.17240 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Pareto Fronts for Compositionally Solving String Diagrams of Parity Games
Open parity games are proposed as a compositional extension of parity games with algebraic operations, forming string diagrams of parity games. A potential application of string diagrams of parity games is to describe a large parity game with a given compositional structure and solve it efficiently as a divide-and-conquer algorithm by exploiting its compositional structure. Building on our recent progress in open Markov decision processes, we introduce Pareto fronts of open parity games, offeri…

Replaced article(s) found for math.CT. https://arxiv.org/list/math.CT/new
[1/1]:
- Quantitative Monoidal Algebra: Axiomatising Distance with String Diagrams
Gabriele Lobbia, Wojciech R\'o\.zowski, Ralph Sarkis, Fabio Zanasi

A generalization of Deterministic Finite Automata related to discharging
John M. Campbell
https://arxiv.org/abs/2506.14072 https://ar…

A generalization of Deterministic Finite Automata related to discharging
Deterministic Finite Automata (DFAs) are of central importance in automata theory. In view of how state diagrams for DFAs are defined using directed graphs, this leads us to introduce a generalization of DFAs related to a method widely used in graph theory referred to as the discharging method. Given a DFA $(Q, Σ, δ, q_{0}, F)$, the transition function $δ\colon Q \times Σ\to Q$ determines a directed path in the corresponding state diagram based on an input string $a_{1} a_{2} \cdots a_{n}$ …