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 (9)

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

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version