Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Irreducible deterministic finite automaton

A deterministic automaton is irreducible when every state is accessible and every pair of distinct states is distinguishable.

Ancestors (6)

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