For every epsilon non-deterministic finite automaton $\epsilon$-NFA there is a non-deterministic finite automaton. NFA accepting the same language. In other words, the class $\mathcal L(\epsilon-\operatorname{NFA})$ of all languages accepted by any $\epsilon$-NFA equals the class $\mathcal L(\operatorname{NFA})$ of all languages accepted by any NFA, formally
$$\mathcal L(\epsilon-\operatorname{NFA})=\mathcal L(\operatorname{NFA}).$$
