DeepAI AI Chat

Asymptotic bit frequency in Fibonacci words

06/25/2021

∙

by Jean-Luc Baril, et al.

∙

∙

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.

Jean-Luc Baril
13 publications
Sergey Kirgizov
13 publications
Vincent Vajnovszki
10 publications

page 1

page 2

page 3

page 4

∙ 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...

0 Jean-Luc Baril, et al. ∙

∙ 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...

0 Péter Burcsi, et al. ∙

∙ 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...

0 Lukas Fleischer, et al. ∙

∙ 08/10/2021

A Note on Squares in Binary Words

We consider words over a binary alphabet. A word w is overlap-free if it...

0 Tero Harju, et al. ∙

∙ 01/03/2022

ℚ-bonacci words and numbers

We present a quite curious generalization of multi-step Fibonacci number...

0 Sergey Kirgizov, et al. ∙

∙ 04/17/2019

Circularly squarefree words and unbordered conjugates: a new approach

Using a new approach based on automatic sequences, logic, and a decision...

0 Trevor Clokie, et al. ∙

∙ 08/19/2019

The Natural Selection of Words: Finding the Features of Fitness

We introduce a dataset for studying the evolution of words, constructed ...

0 Peter D. Turney, et al. ∙