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

DFAs for Union of Languages

Using product construction with modified accept states to build a DFA recognizing the union of two languages.

This lesson is for subscribers

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