RE → DFA Converter
Convert Regular Expressions to Deterministic Finite Automata
Supported Syntax:
a|b— Union (OR)ab— Concatenation (implicit)a*— Kleene Star (0 or more)a+— One or morea?— Zero or one(…)— Grouping
⊕
Enter a Regular Expression
Click "Convert to DFA" to see the step-by-step Direct Method construction