It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property. This expectation can reveal new properties of some telecommunication protocols or interconnection networks.

翻译：众所周知, 含有连续1个字的二进制单词没有 k$ 的一进制 Fibonacci 数字是 $k$- step Fibonacci 数字 。 在本说明中, 我们讨论随机位数的预期值, 随机单数长度为 $n$ 。 这一预期可以揭示某些电信协议或互联网络的新特性 。