4 papers · 1 filter
Skeleton Key: Subduction Classes in Finite Transformation Semigroups and Green's Relations
Attila Egri-Nagy, Chrystopher L. Nehaniv
We establish key connections between Green's - and -relations on a finite semigroup and the subduction relation defined on the image sets of an action of the same s…
The Attractor-Cycle Notation for Finite Transformations
Attila Egri-Nagy, Chrystopher L. Nehaniv
We describe a new notation for finite transformations. This attractor-cycle notation extends the orbit-cycle notation for permutations and builds upon existing transformation notat…
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)\…