Theory of Computation

5. Let B be a language, and define DELETE1(B) to be the language containing all strings that can be obtained by removing exactly one symbol from a string in B. That is, DELETE! (B) {xz | xy2E B where x, z E * and y Show that the class of regular languages is closed under the DELETE1 operation