效绵鼎 Equivalence of RE's and Finite Automata We need to show that for every RE,there is a finite automaton that accepts the same language. o Pick the most powerful automaton type:the E-NFA. And we need to show that for every finite automaton,there is a RE defining its language. o Pick the most restrictive type:the DFA .1010 Equivalence of RE’s and Finite Automata ◼ We need to show that for every RE, there is a finite automaton that accepts the same language.  Pick the most powerful automaton type: the ε-NFA. ◼ And we need to show that for every finite automaton, there is a RE defining its language.  Pick the most restrictive type: the DFA