Closure Properties of Regular Languages Explained
Closure Properties of Regular Languages
A class of languages is said to be closed under an operation if applying that operation on languages of the class results in a language that also belongs to the same class.
👉 Regular languages are closed under several operations.
1. Closure Under Union (∪)
Statement
If L₁ and L₂ are regular languages, then L₁ ∪ L₂ is also regular.
Explanation
- Since L₁ and L₂ are regular, there exist DFAs M₁ and M₂.
- Using product construction, a DFA can be built that accepts strings accepted by either M₁ or M₂.
✅ Hence, regular languages are closed under union.
2. Closure Under Intersection (∩)
Statement
If L₁ and L₂ are regular, then L₁ ∩ L₂ is regular.
Explanation
- Construct a product DFA.
- A
English with a size of 2.89 KB