Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
automata theory
formal languages |
| https://www.w3.org/2000/01/rdf-schema#label |
Myhill-Nerode theorem
|
| gptkbp:namedAfter |
gptkb:Anil_Nerode
gptkb:John_Myhill |
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_American_Mathematical_Society
|
| gptkbp:relatedTo |
equivalence relation
finite automaton regular language minimization |
| 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:year |
1958
|
| gptkbp:bfsParent |
gptkb:Automata_theory
|
| gptkbp:bfsLayer |
5
|