I've got a question that asks me to explain how if a language L is regular, then so is:$M=\{s \in \{a, b\}^* |\ \exists\ t \in L\ such\ that\ |s|_a = |t|_a\}$I believe I would have to get M into the form: $M=\{a^i |\ i\geq0\}$ since we know that any equation of that form is regular, but I'm not quite sure how to go about that using closure properties.
If L is regular, so is L2 (proof using closure properties)
formal languages;regular languages