Finite Automata Simulator
instructions

Formal Definition

States, Q { }
Alphabet, Σ { }
Transition Function, δ For DFA, δ : Q x Σ → Q
For NFA, δ : Q x Σε → P(Q)

Start State, q0 ∈ Q
Final States, F ⊆ Q { }

Transition Table