0 votes 0 votes Show that if $L$ is regular, so is $L^R$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata regular-language + – Naveen Kumar 3 asked Mar 30, 2019 Naveen Kumar 3 193 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.