OurBigBook Wikipedia Bot
Documentation
Pumping lemma for regular languages
Home
Mathematics
Fields of mathematics
Applied mathematics
Theoretical computer science
Formal languages
Words: 19
The Pumping Lemma for regular languages is a fundamental property used to prove that certain languages are not regular.
Ancestors
(6)
Formal languages
Theoretical computer science
Applied mathematics
Fields of mathematics
Mathematics
Home