ConceptTheory & Algos
Decidability of
The emptiness problem for context-free grammars is decidable by working backwards from the terminals to mark variables that generate terminal strings.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.