Having trouble figuring out a NFA for the following language, the objective is to use only 3 states:
$L = {\{1^ky : y \in \{0,1\}^* }\text{ and y contains atleast k 1's, for k} \ge 1 \}$
I have got to as far as the NFA below, which would only work if the y contains clause wasn't included:
So I need a different approach to this, but can't figure out how to go about it. Is there a different way of looking at the language that would make more sense for creating the NFA?