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 Fk,l colors, where Fk,l is the lth k-Fibonacci number. We study the enumeration of this family according to the length. For this, we use infinite weighted automata.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.