Open Access

Asymptotic bit frequency in Fibonacci words

Jean-Luc Baril

Jean-Luc Baril

LIB, Université de Bourgogne Franche-ComtéDijon Cedex, France
Search for this author on
Sciendo|Google Scholar
Baril, Jean-Luc
, 
Sergey Kirgizov

Sergey Kirgizov

LIB, Université de Bourgogne Franche-ComtéDijon Cedex, France
Search for this author on
Sciendo|Google Scholar
Kirgizov, Sergey
 and 
Vincent Vajnovszki

Vincent Vajnovszki

LIB, Université de Bourgogne Franche-ComtéDijon Cedex, France
Search for this author on
Sciendo|Google Scholar
Vajnovszki, Vincent
  
Jun 18, 2022
Asymptotic bit frequency in Fibonacci words's Cover Image
About this article
Previous Article
Next Article
Cite
Download Cover
Published Online: Jun 18, 2022
Page range: 23 - 30
Received: Mar 31, 2022
Accepted: May 15, 2022
DOI: https://doi.org/10.2478/puma-2022-0005
Keywords
© 2022 Jean-Luc Baril et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

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.

Language:
English
Publication timeframe:
4 times per year
Journal Subjects:
Computer Sciences, Theoretical Computer Sciences, Business and Economics, Mathematics and Statistics for Economists, Mathematics, Mathematics, Analysis, Differential Equations and Dynamical Systems
Journal RSS Feed