Finite state automata, multiple completion states?

Problem Detail: 

I'm currently studying for an exam for a course where some of the material covered included finite state automata, I've completed a question and I'm not sure about my answer.

Question http://i.stack.imgur.com/vDFax.png

My Answer http://i.stack.imgur.com/rSnEv.png

Are multiple completion states allowed?

Asked By : Eogcloud

Answered By : Luke Mathieson

Your DFA is a close, but not quite right. Note that the description requires the strings in the language to have at least one $a$, whereas your DFA will accept the empty string. The fix is simple of course:

And yes, having multiple accept states is fine (in fact, some languages require it).

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/6934