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

Ancestors (7)

  1. Deterministic finite automaton
  2. Finite-state machine
  3. Formal language theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

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