ConceptTheory & Algos
Decidability of
The acceptance problem for context-free grammars is decidable by converting the grammar to Chomsky Normal Form and checking derivations of length .
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
4The lectures that define it or assume it, and the concepts next to it.