Using the pumping lemmas, show that the following language is not context-free: 0^n 1^n 0^n 1^n.
a) The language is context-free.
b) The language is regular.
c) The language is context-sensitive.
d) The language is not context-free.

Q&A Education