Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Accessible unary deterministic finite automaton

An accessible automaton over one letter consists of a directed tail entering one directed cycle. Its minimal quotient is obtained by merging positions having the same future binary acceptance sequence.

Ancestors (8)

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

Incoming links (1)