ConceptTheory & Algos
Decidability of
The problem of determining whether an NFA accepts a given string is decidable by converting the NFA to an equivalent DFA and running the DFA acceptance decider.
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.