Definitions
Wiktionary
- n. computer science A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular).
Examples
Sorry, no example sentences found.
Lists
These user-created lists contain the word ‘pumping lemma’.
Tweets
Looking for tweets for pumping lemma.
Comments
No comments yet...
Log in or sign up to get involved in the conversation. It's quick and easy.