ConceptTheory & Algos
Myhill-Nerode theorem
A theorem stating that a set of sequences is recognizable by a finite-state machine if and only if the set of Myhill-Nerode equivalence classes is finite.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.