Terms and definitions for regular language and NFA let's say L is a regular language,what term does L should uphold so that there is an NFA without  epsilon moves,in which for every accepting state δ(q,σ)=Ø?I can think of some terms like that the last letters can't hold a power,but I was wandering if there is a formal definition?
Let $L$ be a regular language. There exists a NFA for $L$ in which $\delta(q,\sigma)=\varnothing$ (for every final state $q$ and every symbol $\sigma$) if $\lambda\notin L$.

We can make this into a characterization: iff $\lambda\notin L$ or $L = \{ \lambda\}$.