2017/11/16 by Thomas Colcombet, Colcombet, Thomas, Daniela Petrişan +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Geometric and Algebraic Topology #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1711.06065
openalex publication_date 2017/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata and automata weighted over a field.