Sign inSign in

Pushdown automaton

A finite automaton that uses a stack to store and retrieve symbols, allowing it to recognize context-free languages.
Watch it explained

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.

Finite automaton2Stack1Stack data structure1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Michael Sipser

    MIT · Undergraduate

    • 25:52Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion

Lectures that assume it

2

Connections

10

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.