so i know that the set of all strings over any finite alphabet is countable, but this question is different
so if our language is set of all regular languages(or set of all regular expressions) on a specific and finite alphabet, then is this set regular? if not then what is it? CFL?
i really can't come up with any FA that can accept this!