RegExp 2 DFA
Rendering ...

first, enter a regular expression (RegExp)
like "01*|00(10)*|01", "abc*|ac*b"

then, convert the RegExp to nondeterministic finite automata (NFA)

then, convert the NFA to deterministic automata (DFA)

finally, minimize the DFA

@GitHub

Nondeterministic Finite Automata
Deterministic Finite Automata
Minimal Deterministic Finite Automata