Definition: Let a family of languages be closed under union, intersection, and complement. Then, this family represents a Boolean algebra of languages.
Boolean Algebra of Languages
Theorem: The family of regular languages is a Boolean algebra of languages.
• The family of regular languages is closed under union, intersection, and complement.
Proof:
19/26