Week #8. Assignmnet 2

using Fibonacci number to proof "Odd Maximal Contiguous Ones Free Strings are binary strings that contain no maximal contiguous substring1of 1s that is of odd length."

first thing is to observe.

all previous OMCOFS elements append "0" or "11", is still OMCOFS.
all non-OMCOFS elements append "0" or "11", is still non-OMCOFS.

using the formula from "INTRODUCTION TO THE THEORY OF COMPUTATION" P78 to proof the assumption.