9 citations · 29 across the 21 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.FL2025
Computational Exploration of Finite Semigroupoids
Attila Egri-Nagy, Chrystopher L. Nehaniv
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but…
math.GR2025
Representation Independent Decompositions of Computation
Attila Egri-Nagy, Chrystopher L. Nehaniv
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups.…
cs.FL2025
On Constructing Finite Automata by Relational Programming
Attila Egri-Nagy, Chrystopher L. Nehaniv
We consider ways to construct a transducer for a given set of input word to output symbol pairs. This is motivated by the need for representing game playing programs in a low-level…