This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1788 of 2,872·40. Theory of Computation: Regular LanguagesPro lesson
Distinguishable and Indistinguishable States
Identifying when two states are equivalent based on whether all continuations lead to the same accept/reject behavior.