Answer:
A push down automata is a type of automata that can only access the top of its stack, whereas a Turing machine can be used to access an infinite tape1. If a push down automata contains more than one stack, it is known as a Turing machine1. One Turing machine is more powerful than one pushdown automaton, as the halting problem for Turing machines is undecidable2
Step-by-step explanation: