Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Indistinguishable states of a deterministic finite automaton

Two states are indistinguishable when every continuation is accepted from both or rejected from both. Distinguishable states admit at least one suffix with different acceptance outcomes.

Ancestors (6)

  1. Deterministic finite automaton
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (1)