Enumeration of k-Fibonacci Paths using Infinite Weighted Automata
classification
🧮 math.CO
keywords
automatacoloredenumerationfamilyfibonacciinfinitepathsweighted
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.