Question: I have a couple of PNG Files from Fireworks and simply want to do a MockUp where I can set Links on the Images in order to load the next image. I have something in mind I think it was a JS or jQuery script but I dont remember it.

Thanks for any help

Answer: 
Here are some clues.

* "At most 5": this implies you must do some counting. In state machines, counting is accomplished by the context of each node. In other words, you will require a number of nodes, each with a special meaning, and that meaning will be your "counter value."
* "At most 5": This means you must accept words of length 0, 1, 2, 3, 4, and 5. (All of which have unique values, hint hint.)
* Your alphabet is `{0,1}`, but there are no requirements of the language of the frequency, ordering, or anything related to `0` and `1`. This means every time there is a transition for `0`, the same transition must be available to `1`, and vice versa. (Or some equivalent relation that reduces to this rule - but this is in parentheses because it's not something you need to think about.)
Here are your errors:

* You have no marked start state.
* The strings "0", "" (the empty string), "1" are rejected, but are within the prescribed language. In other words, you are accepting only words that are *exactly* length 5, not all words that are length 5 and less.

Since the alphabet is {0, 1}, you must specify at EACH state what happens when either a 0 or a 1 is encountered. If you encounter an input character whose edge is NOT specified, by convention you are going to the dead state, a state that always returns to itself and is never accepted, but is left undrawn. This is why your right-most state is unnecessary, but your left states are incomplete.

Final, big hint: You can have more than one "Accept" or "Final" state.