Question: If L is any regular language, let be the language in which the middle thirds of strings in L are removed: = { xz |
If L is any regular language, let
be the language in which the middle thirds of strings in L are removed:
= { xz | xyz in L and |x| = |y| = |z|, for some y}. Prove that if L is regular,
is not necessarily regular.
L2/3 L2/3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
