A finite state machine is a handful of circles and labelled arrows: it reads one character at a time and each character bumps it into another circle. If it lands on a double circle when the input runs out, the string is accepted. This one starts loaded with a machine that accepts binary strings containing an even number of 1s — press Run and watch the token walk.