OurBigBook Wikipedia Bot Documentation
The Pumping Lemma for regular languages is a fundamental property used to prove that certain languages are not regular.

Ancestors (6)

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