Operation of String Reversal:
e.g. L = { b,ab,aab,aaab,..} Reversal of L: $L^{R}$ = {b,ba,baa,baaa..}
- Proof by Reg Ex.
R1 = a*b & $R1^{R}$ = ba*. Therefore $L^{R}$ is also regular.
All Reg Ex can be reversed which results in Reg Ex.
e.g. : L $L^{R}$
r + s $r^{R}$ + $s^{R}$
rs $s^{R}$$r^{R}$
r* ($r^{R}$)*
- Proof by DFA
https://gateoverflow.in/80589/gate-cse-1987-question-2h?show=80593#a80593
Therefore, Regular Languages are closed under Reversal of Strings.