Describe the pushdown automaton (PDA)

A pushdown automaton (PDA) is a computational model that extends finite automata with a stack-based memory. It consists of states, input symbols, stack symbols, transition functions, and a stack that can push and pop symbols. PDAs can recognize context-free languages by using the stack to manage additional information during computation.