##
###
Decision algorithms for Fibonacci-automatic Words, I: Basic results

Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit

2016
*
RAIRO - Theoretical Informatics and Applications
*

*and* comparisons, will decide *the* truth of that proposition. ...
We then recover many results about *the* Fibonacci word from *the* literature (*and* improve some of them), such as assertions about *the* occurrences in f of squares, cubes, palindromes, *and* so forth. ...
See, for example, *the* recent papers [2, 31, 33, 32, 34] . Furthermore, in many cases we can explicitly enumerate various aspects of such sequences, such as *subword* *complexity* [13] . ...

doi:10.1051/ita/2016010
fatcat:bnyljkmxbzcjlnvhz4a5kdbgkq