Pushdown Automata is a finite automaton with extra memory called stack which helps Pushdown automata to recognize Context-Free Languages. The word pushdown stands for that the stack can be pushed down as operations can only work on the elements which are on the top of the stack.
