Question: For any string w = w 1 w 2 w 3 w n the reverses of w, written w R , is the string w
For any string w = w1w2w3wn the reverses of w, written wR, is the string w in reverse order wR = wn w3 w2 w1.
For any language A, let AR = (wR | w A}. Show that if A is regular then AR is also regular.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
