OurBigBook About$ Donate
 Sign in Sign up

Ogden's lemma

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Theoretical computer science Formal languages
 0 By others on same topic  0 Discussions Create my own version
Ogden's lemma is a result in formal language theory, specifically concerning context-free languages (CFLs). It is a generalization of the well-known Pumping Lemma for context-free languages. Ogden's lemma provides a method for proving that certain languages are not context-free by demonstrating that a language does not satisfy the conditions required by the lemma.

 Ancestors (6)

  1. Formal languages
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook