Back to Automaton algorithms
Automaton determinization is the problem of finding a deterministic finite-state automaton recognizing the same language as a given non-deterministic finite-state automaton.