Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Minimal deterministic finite automaton

An irreducible deterministic automaton has the fewest states among deterministic automata for its language and is unique up to isomorphism. Its states are the Myhill--Nerode classes.

Ancestors (7)

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

Incoming links (1)