Question: Let L be any language. We define L0 = {reverse(x)|x 2 L}. (For example, if L = {b, baa, aaabb, aabba}, then L0 = {b,
-
Let L be any language. We define L0 = {reverse(x)|x 2 L}. (For example, if L = {b, baa, aaabb, aabba}, then L0 = {b, aab, bbaaa, abbaa}.)
-
(a) Prove that for any language L, if there is an FA that accepts L, then there is a TG that accepts L0.
-
(b) Prove that for any language L, if there is a TG that accepts L, then there is a TG that accepts L0.
-
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
