没有一定长度的连续零的二进制字符串的数量与斐波纳契数相关。

I'm trying to develop algorithm which would determinate number of binary strings without consecutive zeroes of a certain length. I found solution, which is based on Fibonacci sequence. I don't understand, how the binary string, that ends at the 0 or 1 and not contains repeated 0's depends of Fibonnacci sequence. I'm trying to develop algorithm which would det