Two-sided wreath product of categories (Q1181464)

The Krohn-Rhodes theorem describes a decomposition of a finite monoid into a wreath product of groups and aperiodic monoids. The author gives a generalization of this theorem. He considers monoids as a special case of categories which allow more general structures to appear as buildings blocks in decomposition results. A two-sided version of the wreath product is used as the connecting operation. The paper contains not only theorems interesting from the categorical point of view but also applications to the theory of regular languages. I consider this paper one of the desirable bridges between pure mathematics and computer science.