AI-created image
Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
automata theory
formal language theory |
| gptkbp:introducedIn |
1958
|
| gptkbp:namedAfter |
gptkb:Anil_Nerode
gptkb:John_Myhill |
| gptkbp:relatedTo |
gptkb:finite_automaton
equivalence relation minimization of automata regular language |
| gptkbp:state |
A language is regular if and only if the number of equivalence classes of the Myhill–Nerode relation is finite.
|
| gptkbp:usedFor |
characterizing regular languages
minimization of deterministic finite automata |
| gptkbp:bfsParent |
gptkb:John_Myhill
|
| gptkbp:bfsLayer |
3
|
| https://www.w3.org/2000/01/rdf-schema#label |
Myhill–Nerode theorem
|