Skip to search formSkip to main contentSkip to account menu

Pumping lemma for regular languages

Known as: Pumping lemma (regular languages) 
In the theory of formal languages, the pumping lemma for regular languages describes an essential property of all regular languages. Informally, it… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
2008
2008
  • 2008
  • Corpus ID: 17267883
This does not make it look any easier to use; it makes it look even more foreboding. However, it is useful for the following… 
1999
1999
1994
1994