Let S Finite Set Strings B Eg S Ab B Bbabb Given Language L Alphabet B Regular Show L 0 W Q37054870

Let S be a finite set of strings over over {a, b} (e.g. S = {a,ab, b, bbabb}

(a) Given that some language L over the alphabet {a, b} isregular, show that L 0 = {w|sw ∈ L, s ∈ S} is regular

(b) Repeat the above question with L 0 = {w1w2|w1sw2 ∈ L, s ∈S}.

Answer