A Non-deterministic Pushdown Automaton (NPDA) is a computational model that extends the capabilities of a finite automaton by incorporating a stack, allowing it to recognize context-free languages. Unlike deterministic pushdown automata, NPDAs can make multiple transitions for a given input and stack configuration, enabling them to explore multiple computational paths simultaneously to accept a string if any path leads to an accepting state.