Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Asymptotic bit frequency in Fibonacci words

Asymptotic bit frequency in Fibonacci words AbstractIt 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pure Mathematics and Applications de Gruyter

Asymptotic bit frequency in Fibonacci words

Loading next page...
 
/lp/de-gruyter/asymptotic-bit-frequency-in-fibonacci-words-KH00P5UPrK

References (19)

Publisher
de Gruyter
Copyright
© 2022 Jean-Luc Baril et al., published by Sciendo
eISSN
1788-800X
DOI
10.2478/puma-2022-0005
Publisher site
See Article on Publisher Site

Abstract

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

Journal

Pure Mathematics and Applicationsde Gruyter

Published: Jun 1, 2022

Keywords: Fibonacci; word; pattern; frequency; asymptotics; 05A16; 05A15; 11B39; 68R15

There are no references for this article.