ConceptTheory & Algos
Acceptance problem for NFAs
The language consisting of all pairs containing an NFA and a string it accepts, which is also decidable.
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
2The lectures that define it or assume it, and the concepts next to it.