# Is this NFA correct for the language {w | w ends with an a and no a occurs between any occurrences of b}?

Language: {w | w ends with an a and no a occurs between any occurrences of b}

The NFA must have exactly 3 states.

-
 This one looks okay; the language is $a^*b^*a^*a$. – Brian M. Scott Nov 7 '12 at 22:59 Thanks for confirming. – zeqof Nov 8 '12 at 7:16