For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________
(a) A
(b) A^nZ0, n>=0
(c) Z0A^n, n>=0
(d) None of the mentioned
I got this question in examination.
This interesting question is from From Grammars to Push Down Automata topic in portion Push Down Automata of Automata Theory