So I'm a little bit stuck on how to continue about this problem. "How many bit strings of length eight do not contain six consecutive 0s?"
So what I did first is I found the total amount of bit strings 2^8 = 256.
I know that there must be at least one string with 8 consecutive 0's, at least one with 7 consecutive 0's, and one with at least 6 consecutive 0's. But how do I find how many of each is contained without listing out all the 8 bit strings?