Question: Show that if a language L C {a,b}* is recognised by some finite au- tomaton, then so is the language LR = {WR | W

Show that if a language L C {a,b}* is recognised by some finite au- tomaton, then so is the language LR = {WR | W E L}. (The notation wR means the reverse of string w, that is, the string where the symbols of w are in reverse order.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
