Show simple item record

dc.contributor.authorNehaniv, C.L.
dc.date.accessioned2009-04-15T08:57:02Z
dc.date.available2009-04-15T08:57:02Z
dc.date.issued1996
dc.identifier.citationNehaniv , 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.issn0022-4049
dc.identifier.otherPURE: 101212
dc.identifier.otherPURE UUID: 823130f2-ef13-49cf-8a77-e3eba727049b
dc.identifier.otherdspace: 2299/3172
dc.identifier.otherScopus: 0030602467
dc.identifier.urihttp://hdl.handle.net/2299/3172
dc.descriptionOriginal 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.abstractWe 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.isoeng
dc.relation.ispartofJournal of Pure and Applied Algebra
dc.titleFrom relation to emulation: the covering lemma for transformation semigroupsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.description.statusPeer reviewed
rioxxterms.versionofrecordhttps://doi.org/10.1016/0022-4049(95)00030-5
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record