Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.00837 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916975722102784 |
|---|---|
| author | Egri-Nagy, Attila Nehaniv, Chrystopher L. |
| author_facet | Egri-Nagy, Attila Nehaniv, Chrystopher L. |
| contents | Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of automata. Here, we use relational programming to explore finite semigroupoids to improve our mathematical intuition about these models of computation. We implement declarative solutions for enumerating abstract semigroupoids (partial composition tables), finding homomorphisms, and constructing (minimal) transformation representations. We show that associativity and consistent typing are different properties, distinguish between strict and more permissive homomorphisms, and systematically enumerate arrow-type semigroupoids (reified type structures). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_00837 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computational Exploration of Finite Semigroupoids Egri-Nagy, Attila Nehaniv, Chrystopher L. Formal Languages and Automata Theory 20M20, 20M35 Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of automata. Here, we use relational programming to explore finite semigroupoids to improve our mathematical intuition about these models of computation. We implement declarative solutions for enumerating abstract semigroupoids (partial composition tables), finding homomorphisms, and constructing (minimal) transformation representations. We show that associativity and consistent typing are different properties, distinguish between strict and more permissive homomorphisms, and systematically enumerate arrow-type semigroupoids (reified type structures). |
| title | Computational Exploration of Finite Semigroupoids |
| topic | Formal Languages and Automata Theory 20M20, 20M35 |
| url | https://arxiv.org/abs/2509.00837 |