Course contentsShow
Computer Science
Lesson 1803 of 2,87240. Theory of Computation: Regular LanguagesPro lesson

Closure Properties: Union and Concatenation

Regular languages are closed under union and concatenation operations, proven via automata construction.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.