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

Minimizing DFAs Using Equivalence Classes

Merge indistinguishable states by computing equivalence classes to create minimal DFAs.

This lesson is for subscribers

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