Language: {w | w ends with an a and no a occurs between any occurrences of b}
The NFA must have exactly 3 states.
Language: {w | w ends with an a and no a occurs between any occurrences of b}
The NFA must have exactly 3 states.
It depends a little on what NFA are allowed. Your machine is OK (as Brian told you) but has two initial states. Not everyone likes that.
Alternatively, change the label from (0,a,1) into (0,b,1) and add an edge (0,a,2). Then only state 0 needs to be initial.