ε-NFA → NFA
Remove ε-transitions by giving every state the moves its ε-closure allows.
Hopcroft 2e, §2.5.3
Source · ε-NFA
Result · NFA
Working
| State | ECLOSE | Accepting now? |
|---|
Nothing in the table yet.
The automaton has 1 ε-transitions. Each state's ε-closure decides where it can be before reading anything, and that is what replaces them.
The answer appears at the last step. if you would rather read it than watch it.
How to read itHopcroft 2e, §2.5.3
- One step per state: its ε-closure first, then the transitions that closure induces.
- A state becomes accepting when its closure can reach an accepting state — the step that catches most people out.
- Hopcroft goes straight from an ε-NFA to a DFA. This stops at an ε-free NFA so the two halves can be watched apart.