The class of languages not accepted by non deterministic, nonerasing stack automata is _______
(a) NSPACE(n2)
(b) NL
(c) CSL
(d) All of the mentioned
I had been asked this question by my college director while I was bunking the class.
My doubt stems from PDA-Acceptance by Final State topic in chapter Push Down Automata of Automata Theory