Explicit Epsilon-NFA Workbench

How to use Explicit Epsilon-NFA Workbench

Explore a small state machine through explicit state/transition data. Epsilon closures are computed before consuming symbols, and determinization includes a real empty sink subset when a transition has no destinations.

1. Enter input, input token array json.
2. Choose the settings for explicit epsilon-nfa workbench, then run the tool.
3. Review the result and any limitations before copying or downloading it.

Good to know

• 32 source states, 8 alphabet tokens, 256 transitions, 1,000 input tokens, 256 reachable DFA subsets and 2,000,000 bounded work units. Browser work runs in a module worker with a 2-second compute deadline.
• Null is epsilon; a textual ε alphabet symbol remains an ordinary token. Simulation shows the first 200 trace steps plus exact final states. Determinization refuses overflow instead of returning a partial table; it does not minimize states.
• Processing is local. Output is limited to 1,000,000 text characters unless a stricter file limit is stated.