Fibonacci word
You are encouraged to solve this task according to the task description, using any language you may know.
The standard Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence:
- Define F_Word 1 as 0;
- Define F_Word 2 as 01;
- Form F_Word 3 as F_Word 2 concatenated with F_Word 1 i.e "010"
- Form F_Word n as F_Word n-1 concatenated with F_word n-2
For this task we shall do this for n = 32. You may display the first few but not the larger values of n, doing so will get me into trouble with them what be (again!).
Instead create a table which for F_Words 1 to 36 shows the Rep-string and Entropy.