效绵鼎 Converting a RE to an E-NFA Proof is an induction on the number of operators (+ concatenation,*in the RE ■ We always construct an automaton of a special form (next slide) .1111 Converting a RE to an ε-NFA ◼ Proof is an induction on the number of operators (+, concatenation, *) in the RE. ◼ We always construct an automaton of a special form (next slide)