From relation to emulation and interpretation: computer algebra implementation of the covering lemma for finite transformation semigroups
From MaRDI portal
Publication:6666793
DOI10.1007/978-3-031-71112-1_10MaRDI QIDQ6666793
Chrystopher L. Nehaniv, Attila Egri-Nagy
Publication date: 20 January 2025
Cites Work
- Categories as algebra: An essential ingredient in the theory of monoids
- From cascade decompositions to bit-vector algorithms.
- From relation to emulation: The covering lemma for transformation semigroups
- SgpDec: Cascade (De)Compositions of Finite Transformation Semigroups and Permutation Groups
- Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
This page was built for publication: From relation to emulation and interpretation: computer algebra implementation of the covering lemma for finite transformation semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666793)
