Drawtomata / ε-NFA to NFA converter

Ε-NFA to NFA converter

Draw an NFA with λ (ε) moves above and press Remove λ. Drawtomata computes the λ-closure of each state and builds the equivalent NFA without λ-moves.

The method

  1. For every state q, find λ-closure(q): q and every state reachable from q using only λ-moves.
  2. For every state q and symbol a, the new move δ'(q, a) is λ-closure(δ(λ-closure(q), a)).
  3. A state is final in the new NFA if its λ-closure contains a final state.

The number of states stays the same; only the moves and the final states change.

Questions

Is ε the same as λ?

Yes. Linz writes λ and most other books write ε. Switch between them with the λ/ε button at the top of the page.

Can I go straight to a DFA?

Yes, use NFA to DFA: subset construction handles λ-moves directly.