Near-rings give rise to a number of combinatorial aspects. For example, one can get excellent tactical configurations and balanced incomplete block designs from planar near-rings. Other connections to combinatorics include probability generating functions and rooted trees. A very recent connection is the one to graph theory, where one looks for lengths of synchronizing paths ("Cerny´s Problem"). Adding a group structure to the set of nodes allows the application of results on polynomial completeness in order to get closer to a solution of Cerny´s Problem.