Construct · 1 fields · 1 citations

Myhill-Nerode theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

the result that a language is regular exactly when the equivalence relation of indistinguishable string prefixes has finitely many classes.

In theory of computation, Myhill-Nerode theorem refers to the result that a language is regular exactly when the equivalence relation of indistinguishable string prefixes has finitely many classes. This meaning comes from Nerode (1958) in Proceedings of the American Mathematical Society.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Myhill-Nerode theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

equivalence1 fields · 1 citationsanchor · a standalone construct relation4 fields · 4 citationsjingle · one word, four constructs string4 fields · 6 citationsjingle · one word, four constructs

References

Nerode, A. (1958). Linear automaton transformations. Proceedings of the American Mathematical Society, 9(4), 541-544. https://doi.org/10.1090/s0002-9939-1958-0135681-9

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct