Every

non-deterministic PDA can be converted to an equivalent deterministic PDA

Complement of every context-free language

is recursive

There is a unique

minimal DFA for every regular language

Every NFA can be converted to an equivalent

PDA