Asymptotic bit frequency in Fibonacci words

06/25/2021
by   Jean-Luc Baril, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/19/2020

Gray codes for Fibonacci q-decreasing words

An n-length binary word is q-decreasing, q≥ 1, if every of its length ma...
research
03/05/2020

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word

A prefix normal word is a binary word with the property that no substrin...
research
12/17/2019

New Bounds on Antipowers in Binary Words

Fici et al. defined a word to be a k-power if it is the concatenation of...
research
01/03/2022

ℚ-bonacci words and numbers

We present a quite curious generalization of multi-step Fibonacci number...
research
04/17/2019

Circularly squarefree words and unbordered conjugates: a new approach

Using a new approach based on automatic sequences, logic, and a decision...
research
05/31/2018

On Prefix Normal Words

We present a new class of binary words: the prefix normal words. They ar...
research
11/10/2022

Polyominoes and graphs built from Fibonacci words

We introduce the k-bonacci polyominoes, a new family of polyominoes asso...

Please sign up or login with your details

Forgot password? Click here to reset