the above language is equivalent to " strings starting and ending with same symbol"
-------------------------------------------------------------------------------------------------------------------------------------
let w = 110 and x = 1
then wr = 011.
so string becomes 110 1 011.
we can rewrite this string as
1 10101 1
=> w = 1 and wr = 1 and x = 10101
and regular expression is 1(0+1)*1 + 0(0+1)*0.
we can create a FA for it => language is regular.