In [1]}, Chuan uses Zeckendorf representation to obtain the locations of those subwords whose lengths are Fibonacci numbers \(\ge 2\) . Later in [2]}, Chuan obtain the locations of any finite subword of the Infinite Fibonacci word. In [3]}, Rytter also obtains the location of any finite subword of the Infinite Fibonacci word in a different approach. The locations of any finite subword of the Infinite Fibonacci word can also be known by using the software Walnut. For more details about the Walnut software, one may refer [4]}. Locations of the subwords plays a vital role in proving that the \(\ell \) -Rauzy graph of order \(k\)  for the infinite Fibonacci word is strongly connected for any \(k\)  and \(1\le \ell \le k-1\) .
