What is the minimum number of states in a DFA over {0, 1} that accepts all strings whose third symbol from the right end is 1?

Explanation

The DFA must remember the last three symbols read, which gives 2³ = 8 distinguishable situations, whereas an NFA for the same language needs only 4 states.