Regular Operators with DFAs | Closure Under Union | Theory of Computation

We talk about regular languages, regular operators, and a proof that regular languages are closed under union. We also do an example. Theory of Computation #TheoryOfcomputation #FormalLanguages #FormalGrammar Join this channel to get access to perks: https://www.youtube.com/channel/UCGYSfZbPp3BiAFs531PBY7g/join Instagram: http://instagram.com/TrevTutorOfficial Website: http://TrevTutor.com Subscribe: http://bit.ly/1vWiRxW Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible.