Enumeration of $k$-Fibonacci Paths using Infinite Weighted Automata

Abstract

In this paper, we introduce a new family of generalized colored Motzkin paths, where horizontal steps are colored by means of $F_{k,l}$ colors, where $F_{k,l}$ is the $l$th $k$-Fibonacci number. We study the enumeration of this family according to the length. For this, we use infinite weighted automata.Comment: arXiv admin note: substantial text overlap with arXiv:1310.244