Regular Language Operations: Union, Concatenation & Star

The three regular operations are the union, concatenation, and star operations on languages—the video goes through what exactly that means! You should feel comfortable with regular languages and the operations, as well as NFAs and DFAs before watching this video. If not, you could always watch our previous videos (links below) as review. :)

____________________
Additional resources:

https://youtu.be/miOofcAiINM
- The basics! A video on languages and the operations.

https://youtu.be/PK3wL7DXuuw
- My previous video on finite state machines and DFAs.

https://youtu.be/W8Uu0inPmU8
- My previous video on NFAs. I also go through the empty string and transition in the video.

Michael Sipser. 2006. Introduction to the Theory of Computation (2nd. ed.). International Thomson Publishing.
- The main source of my Theory of Computation knowledge (a textbook). Read Chapter 1.2: Nondeterminism to learn more about closure under the regular operations (and the formal proofs!).
_____________________

And as always, this video project could not have been done without the support and guidance of Audrey St. John at Mount Holyoke College, a truly incredible professor-mentor-human.