dc.contributor.author | Nehaniv, C.L. | |
dc.date.accessioned | 2009-04-15T08:57:02Z | |
dc.date.available | 2009-04-15T08:57:02Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | Nehaniv , C L 1996 , ' From relation to emulation: the covering lemma for transformation semigroups ' , Journal of Pure and Applied Algebra , vol. 107 , no. 1 , pp. 75-87 . https://doi.org/10.1016/0022-4049(95)00030-5 | |
dc.identifier.issn | 0022-4049 | |
dc.identifier.other | dspace: 2299/3172 | |
dc.identifier.uri | http://hdl.handle.net/2299/3172 | |
dc.description | Original article can be found at: http://www.sciencedirect.com/science/journal/00224049 Copyright Elsevier B.V. DOI: 10.1016/0022-4049(95)00030-5 [Full text of this article is not available in the UHRA] | |
dc.description.abstract | We define the kernel of a relational morphism of finite or infinite, faithful or non-faithful transformation semigroups. We prove the covering lemma for transformation semigroups, and a wreath product embedding theorem in terms of this kernel. Applications easily obtained using this new language include a global embedding theorem for right simple semigroups without idempotents, a proof of the Krohn-Rhodes theorem, and some results about transformation groups. | en |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Pure and Applied Algebra | |
dc.title | From relation to emulation: the covering lemma for transformation semigroups | en |
dc.contributor.institution | School of Computer Science | |
dc.contributor.institution | Centre for Computer Science and Informatics Research | |
dc.contributor.institution | Biocomputation Research Group | |
dc.contributor.institution | Department of Computer Science | |
dc.contributor.institution | School of Physics, Engineering & Computer Science | |
dc.description.status | Peer reviewed | |
rioxxterms.versionofrecord | 10.1016/0022-4049(95)00030-5 | |
rioxxterms.type | Journal Article/Review | |
herts.preservation.rarelyaccessed | true | |