theory of computation

Question

Answer 1

if language L1 is regular so it will have a DFA

 if we interchange the final state to start state and start state to final state of dfa and reverse the direction of transition than that DFA will accept the reverse of language so L2 is also  regular

L will also regular as L1 and L2 are regular

Comments

Answer should be yes. :)

---

W^R means reversed string ?

---

Caption

---

Ok got it.