Suppose,
w1= aa
w2= aa
x=ba
string becomes aabaaa
since x is of infinite length as mentioned in question
we could rewrite the string as
w1 = a
x= abaa
w2= a
---------------------------------------------------------------------------------------------------------
w1 =w2
=> Language is "Strings starting and ending with same alphabet."
=> it is regular.
However, if x is of finite length then the language would not be regular.