Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Pure Mathematics and Applications
Volume 30 (2022): Issue 1 (June 2022)
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
Pure Mathematics and Applications
Volume 30 (2022): Issue 1 (June 2022)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
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
Fibonacci
,
word
,
pattern
,
frequency
,
asymptotics
© 2022 Jean-Luc Baril et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
