On the Entropy of Random Fibonacci Words

MaRDI QIDQ6217250zbMATH OpenFDO

Authors Johan Nilsson

Publication date 20 January 2010

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Symbolic dynamics (37B10) Combinatorics on words (68R15)

Abstract: The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0mapsto1$ and $1mapsto01$ with probability $p$ and $1mapsto10$ 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 page was built for publication: On the Entropy of Random Fibonacci Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6217250)