Fibonacci word on the Turing Tumble

The Fibonacci word (Lo02) is unique infinite word fixed by the letter-to-word substitution 0 → 01, 1 → 0. It is aperiodic, and begins
01001010010010100101001001010010...
We generate these first 32 bits of this sequence with the Turing Tumble (TT), using three "bit" components (effectively four bits of memory).

Acknowledgements:

The author acknowledges the support of his PhD supervisor (this is his Turing Tumble).

References:

(Lo02) Lothaire, M. (2002). Algebraic Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge: Cambridge University Press. doi:10.1017/CBO9781107326019

[juzduzd]

Sehr sehr schlechte Leistung!!!👎🏻👎🏻👎🏻👎🏻