For a positive integer n, let sn be the number of n-bit strings having no three
Chapter 4, Problem 17(choose chapter or problem)
For a positive integer n, let sn be the number of n-bit strings having no three consecutive 0s. (a) Determine s1, s2 and s3. (b) Give a recursive definition of sn for n 1.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer