With reference of a DPDA, which among the following do we perform from the start state with an empty stack?
(a) process the whole string
(b) end in final state
(c) end with an empty stack
(d) all of the mentioned
I got this question during an interview for a job.
My question is from Deterministic PDA topic in chapter Push Down Automata of Automata Theory