Thanks:  0

Thread: Prove that if L is regular, then L^R is regular

1. Prove that if $L$ is regular, then $L^R=\{w^R, w\in L\}$ is regular.

Hello MHB! I need if you can help me with this problem. Thank you.

2.

3. One way is to take a regular expression $r$ that generates $L$ and construct an expression that generates $L^R$. It is built by recursion on $r$.

Another way is to take a DFA accepting $L$ and reverse all arrows. One also has to add a new initial state and add $\varepsilon$-transitions from it to all old accepting states.