A well-known result states that every nearring N can be embedded into , for some appropriate group G. On the other hand, in proving this result one defines , or even larger. Though this is nice sometimes, for computing, this embedding is useless. For example, if N has five elements, it is embedded into a nearring with elements. Therefore it is essential to construct transformation representations where G is as small as possible. A preliminary investigation has been done for small nearrings [18].