5 citations · 6 across the 9 of their papers we have counts for
4 papers · 1 filter
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.…
From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
Attila Egri-Nagy, Chrystopher L. Nehaniv
We give a practical computer algebra implementation of the Covering Lemma for finite transformation semigroups. The lemma states that given a surjective relational morphism $(X,S)\…
Computational Enumeration of Independent Generating Sets of Finite Symmetric Groups
Attila Egri-Nagy, Volker Gebhardt
We developed computer algebra tools for enumerating conjugacy classes of independent subsets and generating sets of symmetric groups up to , and carried out an initial analysi…
Finite Diagram Semigroups: Extending the Computational Horizon
James East, Attila Egri-Nagy, Andrew R. Francis +1
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagra…