vix.ing · top · new · best · stats · spec

On the Entropy of Random Fibonacci Words

2010/01/20 by Johan Nilsson, Nilsson, Johan
Biochemistry, Genetics and Molecular Biology · Computer Science · Materials Science · Mathematics · #05A16 #37B10 #68R15 #Combinatorics (math.CO) #FOS: Mathematics #Machine Learning in Bioinformatics #Supramolecular Self-Assembly in Materials #math.CO #msc:05A16 #msc:37B10 #msc:68R15 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1001.3513

11 pages

arxiv created 2010/01/20 · openalex publication_date 2010/01/20 · arxiv updated 2010/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping 0↦ 1 and 1 ↦ 01 with probability p and 1 ↦ 10 with probability 1-p for 0<p<1 and where the random rule is applied each time it acts on a 1. We show that the topological entropy of this object is given by the growth rate of the set of inflated random Fibonacci words.

Related