We present a family of regular languages representing partitions of a set N_n={1,...,n} in less or equal c parts. We determine explicit formulas for the density of those languages and their relationship with well known integer sequences involving Stirling numbers of second kind. We also determine their limit frequency. This work was motivated by computational representations of the configurations of some numerical games.