Name: Anonymous 2011-11-30 0:39
Sup prog,
Soooo, I know you guys hate helping people with homework, but I've been working on this all week and can't figure this shit out. Context-free languages encompass fucking everything, so how the hell can I prove a language isn't one? So far I'm leaning towards using pumping lemma, but I can't formulate a proof where this would work, it's more of a hunch. If anyone would help me I would appreciate it very much, thanks.
PROBLEM:
Prove that the language defined by {a^i b^j c^k | 0 < i < j < k} is not context free.
Soooo, I know you guys hate helping people with homework, but I've been working on this all week and can't figure this shit out. Context-free languages encompass fucking everything, so how the hell can I prove a language isn't one? So far I'm leaning towards using pumping lemma, but I can't formulate a proof where this would work, it's more of a hunch. If anyone would help me I would appreciate it very much, thanks.
PROBLEM:
Prove that the language defined by {a^i b^j c^k | 0 < i < j < k} is not context free.