Codex Wiki
OurBigBook.com
Site
Source code
Myhill-Nerode equivalence
Home
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
Myhill-Nerode theorem
OurBigBook.com
Words: 32
For a language
A
⊆
Σ
∗
, define
v
∼
A
w
⟺
∀
u
∈
Σ
∗
,
vu
∈
A
⟺
w
u
∈
A
.
(37)
This is a right congruence, and its equivalence classes are the states of the minimal
deterministic finite automaton
for
A
.
Ancestors
(6)
Myhill-Nerode theorem
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution