I have a question that asks me to show that the PDA of the language L is not deterministic, but that the language is nevertheless deterministic. I was under the assumption that any deterministic language contains a PDA that is deterministic.The language in question is: $L = \{w \in \{a,b\}^* : n_a(w) = n_b(w)\}$
Can a deterministic language be accepted by a deterministic Push Down Automaton?
formal languages;pushdown automata;nondeterminism