2000 character limit reached
Strongly k-recursive sequences (2401.14231v1)
Published 25 Jan 2024 in cs.FL, cs.DM, and math.CO
Abstract: Drawing inspiration from a paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the converse is not true. We also show that the class of strongly k-recursive sequences is a proper subclass of the class of k-regular sequences, and we present some explicit examples. We then extend the proof techniques to answer the same question for the class of k-recursive sequences.