State elimination converts an automaton into a regular expression by induction over allowed intermediate states. Structural induction converts a regular expression into an epsilon-NFA, which can then be stripped of epsilon transitions.