For any string w = w₁w₂w₃w_n the reverses of w, written w^R, is the string w in reverse order w^R = w_n w₃ w₂ w_1.

For any language A, let A^R = (w^R | w A}. Show that if A is regular then A^R is also regular.