We describe a framework for systematic enumeration of families combinatorial structures that possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These differential equations are then used to determine the initial terms in the counting sequence and for asymptotic analysis. The key tool is the scalar product for symmetric functions.