Transform any Non-Deterministic Finite Automaton into an equivalent DFA instantly. Step-by-step walkthrough, transition tables, and interactive graph visualization.
Full step-by-step trace of the classic algorithm, showing every state set as it's built.
Render both NFA and DFA as crisp directed graphs using Graphviz via Viz.js.
DFA transition table with final states highlighted, dead states clearly marked.
Enter your NFA below using the format shown — or type a Regular Expression and let the tool build the NFA for you. A sample NFA is pre-loaded so you can run it immediately.
Start State: q0
Final States: q2
Transitions:
q0,0=q0,q1 q0,1=q0 q1,0=q2 q2,1=q2
Initial state where computation begins — e.g. q0
Comma-separated list of accepting states — e.g. q1, q2
One transition per line — Format: state,symbol=next1,next2