I've been watching a lot of videos about how to prove this and I am getting mixed information about how to do so.
In the case of contradiction, I am getting two different approaches and I want to know which is correct.
Example:
L = {a^n b^n+1 c^n+1: n>=0}
One source says I can Suppose that the language is context free, choose the sub-strings for u,v,x,y while maintaining that three constraints, that being:
- uv^ixy^iz is in A for all i>=0
- |vy| > 0
- |vxy|<= p
and then show that the string that is pumped is not in the language, even while maintaining the constraints of a CFL. If the string pumped is not in the language, that how I can show the contradiction.
Another Source says there are certain rules that must be followed when choosing vxy, that is vxy must straddle the midpoint... if you divided the string into 5 parts and a constraint isn't met, then that alone is proving that the language is not a CFL.
Basically, which approach is right? what are the rules to dividing up u,v,x,y?