ConceptTheory & Algos
NFA construction for union
Constructing a new NFA that accepts the union of two languages by adding a new start state with -transitions to the start states of the DFAs recognizing those languages.
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.