This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1790 of 2,872·40. Theory of Computation: Regular LanguagesPro lesson
Constructing the Minimal DFA
Merging indistinguishable states to create the minimal equivalent DFA from the partition of state equivalence classes.