Question: = = 2. (15 points). Let L be any language and let LR be the set of reverse strings, i.e. LR= {x | JY E

= = 2. (15 points). Let L be any language and let LR be the set of reverse strings, i.e. LR= {x | JY E L such that [y] = |x| and X122 ... Xn = Ynyn-1... ...Y1}. As an example, if L = {happy, computation, automata, finite}, then LR= {yppah, noitatupmoc, atamotua, etinif}. Show that, if L is regular, so is LR: =
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
