we have a regular language L and B(L) = { wwR (Reverse) | w belongs to L }
we are asked if B(L) is regular.
it seems that L is regular, so LR (Reverse) is regular because regular languages are closed under reverse, and now we concatenate the two languages L and LR, where this proof goes wrong?