I am studying regular express. I understand how to proof a xa ya. However, I don't know how to proof the below problem. Please help me.
L = { xa yb | a ≠ b }
Asked
Active
Viewed 15 times
0
-
Try using closure properties to relate your language to the one you know how to handle. It’s also possible to use the pumping lemma directly, but it requires a trick. – Yuval Filmus Oct 12 '20 at 03:49
-
Yes. But I don't know how to use closure properties. Could you teach me with this sample? – Carlos Oct 12 '20 at 04:23
-
Your language appears in our reference question. – Yuval Filmus Oct 12 '20 at 05:59