A DFA is a state machine that goes to particular state on a given input character. It reads input alphabets one at time and performs transition. If the state after final transition is an accepting state, the input string is accepted otherwise it's rejected. More on DFA theory here https://en.wikipedia.org/wiki/Deterministic_finite_automaton