Let L be any language. Define even(w) as the string obtained by extracting from w the letters in even-numbered positions; that is, if
then
Corresponding to this, we can define a language
even(L) = {even(w) : w $\epsilon$L}. |
|
Prove that if L is regular, so is even(L).