The Young-Fibonacci lattice $\text{YF}$ is the union of all sets $\text{YF}_n$, $n \geq 0$, where $\text{YF}_n$ is the set of all Fibonacci words (binary words whose digits lie in $\{1,2\}$) of weight $n$.
In this lattice, a Fibonacci word $w$ in $\text{YF}_n$ is connected to $w'$ in $\text{YF}_{n+1}$ if $w'$ can be obtained from $w$ by one of the following operations:
Dimension formula: For $w \in \text{YF}$, the dimension $\dim(w)$ counts the number of saturated chains from $\emptyset$ to $w$ and obeys the recursion:
For example, $\dim(22121) = 70$ calculated as: $7 \times 5 \times 2 = 70$, where:
Word: 121
Weight: 4
Dimension: -
Link to code
(This simulation is interactive, written in JavaScript, see the source code of this page at the link)