NFAs With No ε-Moves and a Single Accepting State: When the Start Must Accept

Drop ε-transitions and force one accepting state, and if ε∈L the start must equal that accepting state — which forces every accepted string to loop back, making L closed under concatenation.