I have the following language:
{0m1n0n1m | m,n ≠ 0}
I was wanting to write Context-free grammar for it. I'm a little confused because the rule doesn't mention that m and n are not equal to each other, so could we treat them in a case as the same?
So could something like
S --> 0S1S0S1S
or
S --> 0101 | 0S10S1 | ε