Finite substitution and regular closure properties
You seem to have understood the operation of substitution. That maps any string into a language by concatenating the images of the letters. 

Your argument that regular languages are closed under finite substitution does not work. Even if the substitution maps avery word into a finite language, the substitution of a regular language usually is infinite as the initial ragular language is infinite.

A possible approach is to use regular expressions.