Assume the existence of an automaton $M=(\Sigma^*,Q,q_0,'.',\{q_f\})$ recognizing $L$, the very important observation here is :$w$ is an element of $L_e$ if there exists some words $u$ $v$ $x=0,1$ such that $u(1-x)v$ is accepted by $M_e$, the idea is to memorize the state of all words of this form,consider the following automaton $M'=(\Sigma^*,Q',q_0',T,Q_f)$ defined by:
- $Q'=Q\times2^Q$
- $Q_f=\{(q,S)\in Q'\big/ q_f\in S\}$
- $q'_0=\emptyset $
and the transition function is defined by: $T((q,S),x)=\left(q.x,\left(S.x\cup \{q.(1-x)\}\right)\right)$
If $M'(w)=(q,S)$ this means that $M(w)=q$ and the set $S$ contains the set of all final states of all words of the form $u(1-x)v$ when $uxv=w$, so if $S$ contains the final state $q_f$ then $w$ is accepted by $M'$ and this is exactly what means $w\in L_e$