Partitioning any language to regular?
Every language can be partitioned into a countable union of singleton languages (languages of the form $\{w\}$). Since singleton languages are regular, we get that every language can be partitioned into infinitely many regular languages.