Pushdown automaton

A Pushdown Automaton (PDA) is a type of computational model that extends the capabilities of Finite Automata by incorporating a stack as part of its computation mechanism. This enhancement allows PDAs to recognize a broader class of languages, specifically context-free languages, which cannot be fully captured by Finite Automata.