-1

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.

Owner of Manchester is City
  • 1
  • 2
  • You seem to be asking specifically about applications of the pumping lemma. If so, can you update the question accordingly? – Yuval Filmus May 21 '19 at 16:33

1 Answers1

-1

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

user308485
  • 215
  • 1
  • 7