(Solved) : 3 Let L Language Define L Reverse X X L Example L B Baa Aaabb Aabba L B Aab Bbaaa Abbaa Q44152063 . . .
3. Let L be any language. We define L’ = {reverse(x)|x 
L}. (For example, if L = {b, baa, aaabb, aabba}, then L’ = {b,aab, bbaaa, abbaa}.)
(a) Prove that for any language L, if there is an FA that acceptsL, then there is a TG that accepts L’.
(b) Prove that for any language L, if there is a TG that accepts L,then there is a TG that accepts L’.
Expert Answer
Answer to 3. Let L be any language. We define L’ = {reverse(x)|x L}. (For example, if L = {b, baa, aaabb, aabba}, then L’ = {b, aa…
OR