A Push Down Automata is if there is at most one transition applicable to each configuration?
(a) Deterministic
(b) Non deterministic
(c) Finite
(d) Non finite
I got this question in a job interview.
This intriguing question originated from Right Left Linear Grammar in portion Contextfree Grammar and Syntax Analysis of Compiler