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

Myhill-Nerode Theorem: Characterizing Regularity

A language is regular if and only if it has finitely many equivalence classes.

This lesson is for subscribers

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