Closure Properties of Regular Languages + Proofs

Here we prove five closure properties of regular languages, namely union, intersection, complement, concatenation, and star. We utilize results such as NFAs = DFAs, and give proofs for *why* all of these properties are closed for regular languages. If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1 ▶ADDITIONAL QUESTIONS◀ 1. What about for context-free languages? 2. What about symmetric difference? (Set of strings that are in one of the two languages but not both) 3. What about majority of three languages A, B, C? (i.e., A, B, C are all regular and I want all strings that are in at least two of A, B, C) ▶SEND ME THEORY QUESTIONS◀ [email protected] ▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory.