Talk:Ogden's lemma

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Stub Class	Low Priority	Field: Foundations, logic, and set theory
Please update this rating as the article progresses, or if the rating is inaccurate. Please also add comments to suggest improvements to the article.

What is "distinguished" ? The term is introduced in quotes, but it is not defined. Maybe I misunderstood? —Preceding unsigned comment added by 212.225.68.142 (talk • contribs) 11:45, 7 March 2006

it means it's marked. maybe it will be clearer if I removed the word "distinguished" --Spoon! 02:37, 14 December 2006 (UTC)

Two remarks.

Ogden's Lemma still is not powerful enough to characterize the context-free languages. There are non-CF languages that pass Ogden's test.

The example language given indeed satisfies the classical pumping lemma. An easy way to show its non-CF-ness is to intersect it with a properly chosen regular language (fixing the number od a's to 1) Jochgem 07:27, 13 April 2007 (UTC)