On the State Complexity of k-Entry Deterministic Finite Automata