Why pumping lemma for CFG doesn't work...

Is there a regular expression that return substrings from a string, that do not match a given list o...

why number of string should be greater than or equal to number of states in pumping lemma?...

Basic Pumping Lemma proof doesn't make sense...

Pumping Lemma On Context Free Language...

Pumping lemma for context-sensitive language?...

Pumping lemma to show that `{a^n b^m | n=km for k in N}` is not regular...

Is this language regular? {0^n 1^m | m != n}, I don't understand the direct proof by pumping len...

Pumping Lemma's Condition 3 concept...

Pumping Lemma for CFL a^n b^m c^o for n<m<o...

Pumping lemma for language that is regular...

Is this the correct way to use the pumping lemma?...

Pumping lemma on regular languages?...

Is a^i^2 | i>=1 regular?...

Contextfree language or not? I can write a grammar but not use pumping lemma...

How do you prove this pumping lemma example?...

Can someone help me with this proof using the pumping lemma?...

Is this language regular? {a^i b^j| i=j mod 19}...

Am using the pumping lemma correctly?...

Pumping Lemma, Condition 1...

Pumping lemma in PDA and CFL...

prooving that a language of form 0^n where n is prime is neither regular nor context free...

A detail on the Pumping Lemma for regular languages...

Design a language L such that neither L nor its complement has an infinite regular subset?...

Pumping Lemma with Context Free Languages...

Quick/Simple Regex/Regular Language Clarification...