Complexity of Linear Subsequences of Fibonacci-Automatic Sequences

Abstract: We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of states. We also consider some basic operations on Fibonacci-automatic sequences and discuss their state complexity. Furthermore, as a consequence of our results, we improve a bound in a paper of Bosma and Don. We also discuss the state complexity and runtime complexity of using a reasonable interpretation of Büchi arithmetic to actually construct some of the studied automata recognizing relations.