# Finite state automata, multiple completion states?

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.

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

Are multiple completion states allowed?

-
I suggest writing down the questions from the images to the question itself here. This is if/when the links break, the question here becomes meaningless. –  Juho Nov 27 '12 at 1:53
add comment

## 1 Answer

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).

-
Didn't consider the empty string, thanks for your help! –  Eogcloud Nov 27 '12 at 2:50
add comment