In this paper, we give two descriptions of the languages recognized by finite supersoluble groups. We first show that such a language belongs to the Boolean algebra generated by the modular products of elementary commutative languages. An elementary commutative language is defined by a condition specifying the number of occurrences of each letter in its words, modulo some fixed integer. Our second characterization makes use of counting functions computed by transducers in strict triangular form.