Proving by using intersection construction that language is regular

62 Views Asked by At

L is a regular language and Σ is the alphabet . Proof using intersection construction that L' is a regular language.

two muppets http://imageshack.com/a/img661/4318/T38eP9.png

which languages I should intersect?