Enumeration of Factor Occurrences in $k$-Bonacci Words over an Infinite Alphabet

Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori +1

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information.…