myhill_nerode_theorem (329B)
1 # Myhill nerode theorem 2 3 https://en.wikipedia.org/wiki/Myhill%E2%80%93Nerode_theorem 4 5 The [theorem] that says that a [formal_language] is a [regular_language] iff the [Myhill_nerode_equivalence] has a finite number of [equivalence_classes] 6 7 Up: [formal_language_theory] 8 9 See also: [Myhill_nerode_equivalence], [DFA_minimization]