Equivalence of NFA and NFA with -transitions

Th: If L is accepted by an NFA with -transitions, then L is accepted by an NFA without such transitions.

Proof:

with -transitions can be converted to such that
if -closure
Otherwise F'=F

Note that M' does not have any -transitions.

• Example