This regular expression defines the language of all words that contains one 'a' at least if not more.
So you have a start state which accepts either an 'a' or a 'b'.You represent this by drawing a circle with a negative sign inside of it.The
' * ' indicates a closure ( combination of a's and b's ).This you should indicate by drawing an arrow which starts at the circle you have just drawn ( start state ) and which returns to the same state (ie. the same circle with the negative sign in it ).Thereafter the FA accepts the letter 'a'.This you should indicate by drawing an arrow away from the start state ( the circle containing the negative sign ) and then directing it towards another circle ( no sign inside of it ! ). Indicate the letter 'a' on this arrow.
Thereafter the FA accepts either the letter 'a' or the letter 'b'.This is indicated by drawing another arrow away from the previous one directing it towards another circle ( this circle must have a PLUS (+) sign inside of it.Indicate 'a,b' on this arrow .... VOILA !
I sure hope this makes sense and i hope my understanding of it is correct !
If there's anyone that disagrees then you're welcome to give your input.
