This finite state automata, representing a regular expression, has a start state of 0 and two accepting states, 3 and 5. Move the red spot through it by clicking on the nodes or edges and see how the language accepts some strings and not others.