Nota: La traducción de esta entrada está actualmente en revisión de calidad, por lo que parte del contenido se muestra temporalmente solo en inglés.
Esta entrada aún no se ha traducido a tu idioma, así que se muestra el original a continuación.
pushdown automaton
This term is a technical specification used primarily in theoretical computer science and formal language theory. It describes a specific class of automata that can recognize context-free languages, which are more complex than the regular languages handled by finite automata. The defining characteristic is the inclusion of a stack, which allows the machine to remember an arbitrary amount of information in a last-in, first-out manner.
In practical application, this model is the theoretical foundation for the design of compilers, specifically the parsing phase. While a finite automaton can only track a fixed number of states, the pushdown automaton uses its stack to handle nested structures, such as balanced parentheses or nested function calls in programming code.