Which of the following belong to the steps to prove emptiness?
(a) Remove useless variable
(b) Check if a start variable S is useless
(c) Both (a) and (b)
(d) None of the mentioned
The question was posed to me in class test.
My enquiry is from Intersection with Regular Languages in section Properties of Context Free Languages of Automata Theory