ConceptTheory & Algos
Closure under union
The property that if two languages are regular, their union is also a regular language, proven by constructing a product machine that simulates both machines simultaneously.
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.