Regular Expression to DFA Converter

Input

Use standard regex syntax: * for Kleene star, | for union, () for grouping

How It Works

The conversion process follows these steps:

  1. Parse the regular expression and convert to postfix notation
  2. Apply Thompson's Construction to build an NFA
  3. Use Subset Construction to convert NFA to DFA
  4. Optionally minimize the DFA

Results

Postfix Notation

Enter a regular expression and click "Convert to DFA"

NFA Transition Table

NFA table will appear here

DFA Transition Table

DFA table will appear here

Minimized DFA

Minimized DFA table will appear here

Minimized DFA Diagram

Minimized DFA diagram will appear here