ConceptTheory & Algos
Pushdown automaton
A finite automaton that uses a stack to store and retrieve symbols, allowing it to recognize context-free languages.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Michael Sipser
Lectures that assume it
2Connections
10The lectures that define it or assume it, and the concepts next to it.