![2, (5 points) Let Σ be an alphabet which does not contain $ . Let w be a any string over Σ. We define Typo(w) to be the set of strings in which exactly one symbol in w is replaced by $. Let A be any regular language over Σ. Let B(A)-{x | x Typo(w) for any w e A]. Prove B(A) is regular](http://d2vlcm61l7u1fs.cloudfront.net/media%2F09d%2F09d74982-1794-4a68-9fe9-5da08e7caf7a%2FphpxxKNWk.png)
2, (5 points) Let Σ be an alphabet which does not contain $ . Let w be a any string over Σ. We define Typo(w) to be the set of strings in which
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured
![2, (5 points) Let Σ be an alphabet which does not contain $ . Let w be a any string over Σ. We define Typo(w) to be the set of strings in which exactly one symbol in w is replaced by $. Let A be any regular language over Σ. Let B(A)-{x | x Typo(w) for any w e A]. Prove B(A) is regular](http://d2vlcm61l7u1fs.cloudfront.net/media%2F09d%2F09d74982-1794-4a68-9fe9-5da08e7caf7a%2FphpxxKNWk.png)
2, (5 points) Let Σ be an alphabet which does not contain $ . Let w be a any string over Σ. We define Typo(w) to be the set of strings in which
PayPal Gateway not configured
PayPal Gateway not configured