-1
$\begingroup$

When I prove some language is context free, It is too hard to find example string. Is there any tips? It takes too many time or eventually give up.

$\endgroup$
  • $\begingroup$ You seem to be asking specifically about applications of the pumping lemma. If so, can you update the question accordingly? $\endgroup$ – Yuval Filmus May 21 at 16:33
-1
$\begingroup$

The pumping lemma for CFGs can often be used to show a language is not a CFL.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.