Difference between finite automata and turing automata or turing machine?

Answer 1

A push down automaton can actually store information in a stack as it processes it. It can then choose what to do next by looking at the top of the stack.

DFAs and NFAs can't do that stuff, but any DFA or NFA can also be represented as a push down automaton.

Answer 2

Turing machine is similar to finite automata with read/write head. Means the difference is read/write head.

turing machine is capable of performing any calculation which can be performed by any computing machine.

Every automaton can be simulated by a Turing machine.

Turing machines can compute.

Answer 3

A push down automaton can actually store information in a stack as it processes it. It can then choose what to do next by looking at the top of the stack.

DFAs and NFAs can't do that stuff, but any DFA or NFA can also be represented as a push down automaton.