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.)
I think the DFA shown above is wrong. It will accept strings up to length 5 so you should make all the first six states to be final states. You are accepting only '1's but it should also accept '0's......so attach 0 with all 1's.