Can you explain what strings these language accept and how do I prove that these languages are regular:

1) L = {w {0,1}* | x,y {0,1}* , n 0 : w = x(0^n)(1^n)y}

2) L = {w {0,1}* | x,y {0,1}* : w = x0y, |xy| > 0}