Abstract

It is known that binary words containing no kk consecutive 1s are enumerated by kk-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length nn having this property.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.