Enumeration of r-smooth words over a finite alphabet

Abstract

In this paper, we enumerate a restricted family of k -ary words called r -smooth words. The restriction is defined through the distance between adjacent changes in the word. Using automata, we enumerate this family of words. Additionally, we give explicit combinatorial expressions to enumerate the words and asymptotic expansions related to the Fibonacci sequence