NFA to DFA Converter

Subset Construction Visualizer

Vipul 2024UCS1515

✦ Describe Your Language

Type a language description in plain English or a regular expression — the NFA and DFA will be generated automatically

✦

Try:

01 Define Your NFA

Configure the states, alphabet, and transitions of your Nondeterministic Finite Automaton

Q

States

Enter states (comma separated) Start State Accept States (comma separated)

Σ

Alphabet

Input symbols (comma separated)

Include ε-transitions

δ Transition Function

From State	Symbol	To States

Tip: For multiple destination states, separate with commas (e.g. q1, q2)

Quick Examples:

02 Subset Construction Steps

Watch the algorithm build the DFA state by state using subset construction

Construction Steps

0 / 0

Define an NFA and click "Convert to DFA" to see the algorithm steps here.

DFA Transition Table

DFA State

Start Accept Current Dead/Trap

03 Automata Visualization

Graphical comparison of the original NFA and the constructed DFA

Original NFA

→

Subset
Construction

→

Constructed DFA

🧪 Test a String