anonymous
  • anonymous
refer to the sequence S where S subset of n denotes the number of n-bit strings that do not contain the pattern 00. Show that S_n = f_(n+2,) n = 1, 2, …, where ƒ denotes the Fibonacci sequence.
Mathematics
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
Let's say we have a 2-bit string. If it starts with \(1\) (i.e. the string is \(1x\) where \(x\) is a \(1\) or \(0\)), how may possible strings are there that don't contain \(00\)? What if the string starts with \(0\) (\(0x\))?
anonymous
  • anonymous
Now suppose we have a 3-bit string. How many strings \(1xx\) don't contain \(00\)? How many strings \(0xx\)? The 3-bit strings starting with \(1\) is the same as the total number of 2-bit strings, while the 3-bit strings starting with \(0\) MUST be the same as the number of 2-bit strings that started with \(1\) (otherwise we'd get a string with \(00\)). See where this is going?

Looking for something else?

Not the answer you are looking for? Search for more explanations.