The pumping lemma is often used to prove that a language is:
Posted: Thu Jul 14, 2022 9:26 am
a) Context free
b) Not context free
c) Regular
d) None of the mentioned
b) Not context free
c) Regular
d) None of the mentioned
Accurate answers. Every time.
https://answerhappy.com/