Irreducible deterministic finite automaton
ID: irreducible-deterministic-finite-automaton
A deterministic automaton is irreducible when every state is accessible and every pair of distinct states is distinguishable.
New to topics? Read the docs here!