pith. sign in

arxiv: 1001.3513 · v1 · submitted 2010-01-20 · 🧮 math.CO

On the Entropy of Random Fibonacci Words

classification 🧮 math.CO
keywords fibonaccirandommapstoentropyprobabilityrulewordsacts
0
0 comments X
read the original abstract

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.