Explain in clear but precise English what an NFA with $\backslash$epsi $-$moves is$.$

Your explanation should include explanations of the terms vocabulary,

initial state, final state, transition, $\backslash$epsi $-$transition, and of

what we mean when we say that an automaton recognises a

language L$.$

Your explanation should also include at least two example automata

which illustrate these terms, along with a clear statement

of the languages which they recognise.