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

Closure Properties: Star and Complement

Regular languages are closed under Kleene star and complement, using NFA and DFA transformations.

This lesson is for subscribers

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