Relation of deterministic push down automata and lower elementary recursion
No, that doesn't follow at all.  There are problems that can be solved in polynomial time, but that don't correspond to any deterministic context-free language.