Catatan: Terjemahan untuk entri ini sedang dalam peninjauan kualitas, sehingga sebagian konten untuk sementara hanya ditampilkan dalam bahasa Inggris.
Entri ini belum diterjemahkan ke bahasa Anda, sehingga versi aslinya ditampilkan di bawah.
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.