Which of the following can be used to prove a language is not context free?
(a) Ardens theorem
(b) Power Construction method
(c) Regular Closure
(d) None of the mentioned
This question was addressed to me in exam.
Origin of the question is Intersection with Regular Languages topic in section Properties of Context Free Languages of Automata Theory