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.
$\begingroup$
$\endgroup$
1
-
$\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 '19 at 16:33
Add a comment
|
$\begingroup$
$\endgroup$
The pumping lemma for CFGs can often be used to show a language is not a CFL.
