Run a word through a DFA one symbol at a time: one state, one move per symbol, and accept or reject at the end.
This interactive visualization needs JavaScript.