I am interested in the number of binary strings of length $m$ and Hamming weight $r$, which do not contain $k$ consecutive zeros. A nice derivation of that number is in Number of binary and constant-weight strings of length m which do not contain k consecutive zeros.
In particular, the bivariate ordinary generating function of this number is $$ F(z,t) = \frac{1-z^k}{1-(t+1)z+tz^{k+1}}$$ where $z$ is assigned with the string length and $t$ is assigned with the Hamming weight.
Now I am interested on the asymptotic behaviour of this number, when $m$ is very large. I hope that there is some simpler expression $g(m,k,r)$ for the asymptotic case, i.e $f_{m,r} \sim g(m,k,r)$ for $m \rightarrow \infty$, where $r$ is the Hamming weight. $k<m$ and we can assume that the given $k$ is very small relatively to $m$, when $m$ becomes very large.
Can someone help me with this problem?
