title: Demonstrating a language is regular
body: <p>So I'm trying to do this sort of problem that says:
  Demonstrate that a language conformed by binary numbers of Fibonacci length, is not a regular language.  </p>
  
  <p>I really don't know how to approach it nor am I sure if I understand it.</p>