Computer science Automata and formal languages Concept
Pushdown automaton
Summary
A pushdown automaton is a finite automaton equipped with an unbounded stack. At each move it reads at most one input letter and the top symbol of the stack. Then it changes state and replaces the top symbol by a string. Nondeterministic pushdown automata accept exactly the context-free languages. They are the machine model behind parsers for programming languages.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 8YEY51Q3B5 |
|---|---|
| URI | m2://8YEY51Q3B5 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q45, 68Q04 |
| Specializes | Model of computation |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.