Question: need help understanding this, thanks. 2. For any string w = wi... Wn the reverse of the string denoted wR is the string w' =

need help understanding this, thanks.
2. For any string w = wi... Wn the reverse of the string denoted wR is the string w' = Wn...wi. The reverse of a language L, denoted L= {wR | W E L}. Show that if L is regular then LR is regular
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
