Question: For a language L * and a string y *, the language L_y = {xz : x * and z * and xyz L}
For a language L * and a string y *, the language L_y = {xz : x * and z * and xyz L} consists of all strings in L with the string y deleted from them. (a) Prove that if L is regular, then L-y is regular. Hint: make |y| + 1 copies of a DFA recognizing L. (b) Prove that if L is R.E., then L-y is R.E.
Step by Step Solution
There are 3 Steps involved in it
a Proof that if L is regular then Ly is regular Let M be a DFA recognizing L We can construct a new DFA My that recognizes Ly as follows 1 Create a copy of M for each character in y This will give us ... View full answer
Get step-by-step solutions from verified subject matter experts
