|
Trying to prove L is not CF |
|
|
L includes strings of the form a^N b^N c^N |
|
|
This is NOT enough to say that L is not context free |
|
|
Both a* b* c* and a^N b^N c^N include strings of the form a^N b^N c^N, the first is regular and context free, the second is not context free. |
|
|
L = a^n b^n*m c^n. Trying to show L is not CF. |
|
|
You can pick the value of m for a particular string, such as m=1, w = a^2M b^2M c^2M |
|
|
You CANNOT pick the value of m for the language, the language is given to you, you cannot change it. It accepts strings for all values of m. |
|
|
Use pumping on w to show the resulting string is not in L. |