What language should this NFA recognise?
Don't overthink it; your intuition is correct. The only strings that get you from the start state to the final state are $&lt;anything&gt;11$ or $&lt;anything&gt;101$. Once you're in the final state, any subsequent inputs are also accepted, so the language accepted by this FA is, as a regular expression, $(0+1)^*(11+101)(0+1)^*$, which is obviously all strings containing 11 or 101.