1 votes 1 votes The reverse of a string can be defined more precisely by the recursive rules $a^R=a$, $(wa)^R=aw^R$, for all $a∈Σ$, $w∈Σ^*$. Use this to prove that$(uv)^R=v^Ru^R$, for all $u,v∈Σ^+$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation proof + – Naveen Kumar 3 asked Mar 17, 2019 Naveen Kumar 3 364 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes $(uv)^R = v^Ru^R,$ for all strings $u,v.$ If $u = \epsilon,$ then $u^R = \epsilon$ and hence $(uv)^R = v^R = v^Ru^R.$ If $v = \epsilon,$ then $v^R = \epsilon$ and hence $(uv)^R = u^R = v^Ru^R.$ Now, suppose $u = u_1u_2 \dots u_m$ and $v = v_1v_2 \dots v_n$, with $m,n \geq 1.$ Then, $(uv)^R = (u_1u_2 \dots u_mv_1v_2 \dots v_n)^R = v_n \dots v_2v_1x_m \dots x_2x_1 = v^Ru^R.$ Detailed Video Solution Deepak Poonia answered Aug 11, 2022 Deepak Poonia comment Share Follow See all 0 reply Please log in or register to add a comment.