Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Myhill–Nerode theorem · Vinony

🌐English

English Deutsch Español Français Italiano Nederlands Polski Português Türkçe Русский فارسی 中文日本語

EntityQ422187· pop 15· linked from 20 articles

Myhill–Nerode theorem

theorem

Available in 15 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
Croatian
Czech

Connections

International Standard Book Number

digital object identifier

Categories

Finite-state machines Formal languages Theorems in discrete mathematics

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

University of Chicago

Entity

equivalence relation

formal language

theoretical computer science

necessity and sufficiency

John Edward Hopcroft

equivalence class

Jeffrey David Ullman

deterministic finite automata

regular language

pumping lemma for regular languages

proof by exhaustion

DFA minimization

Sign in to save

What links here20 pages

regular language

DFA minimization

pumping lemma for regular languages

automata theory

Suffix automaton

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Wallace–Bolyai–Gerwien theorem

Entitydist 0.56

Entitydist 0.58

Pohlke's theorem

Entitydist 0.58

Haruki's Theorem

Entitydist 0.58

Baranyai's theorem

Entitydist 0.59

Hadwiger's theorem

Entitydist 0.60

Entitydist 0.60

Norton's theorem

Entitydist 0.63

Cauchy's theorem

Entitydist 0.64

Max-flow min-cut theorem

Entitydist 0.64

Entitydist 0.64

Carnot's theorem (conics)

Entitydist 0.65