# Question: for any stringww1w2wn the reverse of w written wr is...

###### Question details

For any stringw=w_{1}w_{2}...w_{N}, the
reverse of w written w^{R} is the string in reverse order
w_{N}w_{N-1}...w_{1}. For any language
A^{R}={w^{R}|w∈A}.

If A is regular and B is regular, prove that the following languages are regular.

i) {w^{R}y^{R}|w∈A, y∈B}is regular.