PDA stands for Pushdown automata. It is a finite state machine that store data in a pushdown stack. It acts as a recognizer for context-free languages. read more
1.PDA equivalent in power to a CFG – Can choose the representation most useful to our particular problem. 2.Consume the input symbol. If is the input symbol, then no input is consumed. read more
It chooses a new state, the result of following the transition. A pushdown automaton (PDA) differs from a finite state machine in two ways: It can use the top of the stack to decide which transition to take. It can manipulate the stack as part of performing a transition. A pushdown automaton reads a given input string from left to right. read more