Q.Is the language L2={y: there exist x and z such that |x|=|z| and xyz belons to L} regular?
A. yes it should be regular since length is equal
example
1. take any string aab
here x= a, y= a, z= b
2. take another string aabab
here x= aa, y= b, z=ab
any string can be broken into xyz such that x ans z is equal .