Automaton Design Sandbox
Build a machine and flip it between DFA and NFA rules to see exactly what determinism costs you.
1
1
0
1
Start at q0. Input is "1101".
step 1 of 6
active statetransition taken / next symboldouble circle = accepting
reading…
- Active states
- q0
- Symbols read
- 0 / 4
← → to step, or use the buttons above.
Build your DFA
One character per symbol, up to 4. Removing a symbol drops its transitions.
| State | 0 | 1 | Acc | Start | |
|---|---|---|---|---|---|
| q0 | |||||
| q1 | |||||
| q2 |
One target per cell. Clicking a different state replaces the old one; clicking the lit one clears it.