Question

Difference between pda by empty stack and pda by final state

Answer 1

A push down automaton (PDA) is a finite state machine which has an additional stack storage.  The transitions a machine makes are based not only on the input and current state but also on the stack.

Push down automaton, In a final state PDA accepts a string, when and after reading the entire string, the PDA is in a final state.

The stack values in PDA can be irrelevant as long as the values ends up in final state.

Empty stack accepts a string when after reading the entire string, the PDA has emptied its stack.

Answer 2

A push down robot (PDA) is a limited state machine which has an extra stack storage.  The changes a machine makes are put together not just with respect to the info and current state yet additionally on the stack.  

Push down robot, In a last state PDA acknowledges a string, when and in the wake of perusing the whole string, the PDA is in a last state.  

The stack esteems in PDA can be insignificant as long as the qualities winds up in definite state.  

Void stack acknowledges a string when subsequent to perusing the whole string, the PDA has purged its stack