ConceptTheory & Algos
Closure under union for regular languages
The property that if two languages are regular, their union is also a regular language, proven here using non-determinism.
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.
Regular language1Union of languages1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.