Definition
Build L₁ ∪ L₂ — strings accepted by either machine.
Build L₁L₂ — L₁ then L₂.
Build L* — zero or more repetitions of L.
Subset construction — equivalent DFA.
Fields: states, alphabet,
transitions, start, accepts.
NFAs: comma to or "" for ε.
Pick a tab, compose or edit, then build.
Simulation
Step mode
- State
- —
- Next
- —
- Pos
- 0 / 0
Build a machine, then simulate.