ConceptTheory & Algos
NFA to DFA conversion
A deterministic finite automaton can be constructed to simulate a non-deterministic finite automaton by having its states correspond to subsets of the NFA's states.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
5The lectures that define it or assume it, and the concepts next to it.