A PDA machine configuration (p, w, y) can be correctly represented as:
(a) (current state, unprocessed input, stack content)
(b) (unprocessed input, stack content, current state)
(c) (current state, stack content, unprocessed input)
(d) none of the mentioned
I had been asked this question in final exam.
My question is taken from Deterministic PDA in division Push Down Automata of Automata Theory