RegExp & DFA Converter

← Back to Apps

Convert Regular Expressions to Deterministic Finite Automata (DFA) and vice versa. Includes step-by-step simplification and state diagram rendering.

Use ε for Empty String, + for Union, * for Kleene Star, and adjacent characters for concatenation.

Formal Definition

N/A

Simplification Steps

N/A

Transition Table

Select the target state for each input. Leave blank for no transition.

State Elimination Steps

N/A

Final Regular Expression

N/A

Created for UTK COSC312 Algorithm Analysis and Automata and for COSC580 Foundations.